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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K 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 DoubleExponent-PT-010-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652641716795

Running Version 202205111006
[2022-05-15 19:08:37] [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-15 19:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:08:38] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-15 19:08:38] [INFO ] Transformed 534 places.
[2022-05-15 19:08:38] [INFO ] Transformed 498 transitions.
[2022-05-15 19:08:38] [INFO ] Parsed PT model containing 534 places and 498 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 62 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 530 cols
[2022-05-15 19:08:38] [INFO ] Computed 51 place invariants in 71 ms
[2022-05-15 19:08:38] [INFO ] Implicit Places using invariants in 392 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 422 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 527 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 527 transition count 497
Applied a total of 2 rules in 61 ms. Remains 527 /528 variables (removed 1) and now considering 497/498 (removed 1) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:08:38] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-15 19:08:39] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:08:39] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-15 19:08:40] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 527/534 places, 497/498 transitions.
Finished structural reductions, in 2 iterations. Remains : 527/534 places, 497/498 transitions.
Support contains 27 out of 527 places after structural reductions.
[2022-05-15 19:08:41] [INFO ] Flatten gal took : 66 ms
[2022-05-15 19:08:41] [INFO ] Flatten gal took : 32 ms
[2022-05-15 19:08:41] [INFO ] Input system was already deterministic with 497 transitions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 149383 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149383 steps, saw 74705 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:08:45] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-15 19:08:45] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-15 19:08:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2022-05-15 19:08:45] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:08:47] [INFO ] After 1745ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2022-05-15 19:08:47] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 6 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 1 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 113 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 424 ms
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2022-05-15 19:08:48] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 789 ms
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 1 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 0 ms to minimize.
[2022-05-15 19:08:49] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:08:50] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 0 ms to minimize.
[2022-05-15 19:08:50] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 0 ms to minimize.
[2022-05-15 19:08:50] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2022-05-15 19:08:50] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 1 ms to minimize.
[2022-05-15 19:08:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1309 ms
[2022-05-15 19:08:52] [INFO ] After 6112ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :15
Attempting to minimize the solution found.
Minimization took 1903 ms.
[2022-05-15 19:08:54] [INFO ] After 8491ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :15
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 14771 ms.
Support contains 23 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 525 transition count 393
Reduce places removed 102 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 110 rules applied. Total rules applied 214 place count 423 transition count 385
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 222 place count 415 transition count 385
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 222 place count 415 transition count 365
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 262 place count 395 transition count 365
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 4 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 428 place count 312 transition count 282
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 458 place count 297 transition count 282
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 3 with 42 rules applied. Total rules applied 500 place count 297 transition count 240
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 542 place count 255 transition count 240
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 579 place count 255 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 254 transition count 239
Applied a total of 580 rules in 115 ms. Remains 254 /527 variables (removed 273) and now considering 239/497 (removed 258) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/527 places, 239/497 transitions.
Incomplete random walk after 10000 steps, including 1214 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 181053 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181053 steps, saw 90550 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 239 rows 254 cols
[2022-05-15 19:09:12] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:09:12] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 19:09:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 19:09:12] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 23 ms returned sat
[2022-05-15 19:09:13] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:09:14] [INFO ] After 793ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:14] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:09:14] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 0 ms to minimize.
[2022-05-15 19:09:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2022-05-15 19:09:14] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 459 ms.
[2022-05-15 19:09:15] [INFO ] After 2694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 13167 ms.
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 254/254 places, 239/239 transitions.
Applied a total of 0 rules in 16 ms. Remains 254 /254 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 239/239 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 254/254 places, 239/239 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 239/239 (removed 0) transitions.
// Phase 1: matrix 239 rows 254 cols
[2022-05-15 19:09:28] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:09:29] [INFO ] Implicit Places using invariants in 501 ms returned [20, 26, 48, 54, 106, 112, 133, 138, 139, 159, 166, 192, 199, 206, 244, 251]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 505 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 238/254 places, 239/239 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 233
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 232 transition count 233
Applied a total of 13 rules in 39 ms. Remains 232 /238 variables (removed 6) and now considering 233/239 (removed 6) transitions.
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:29] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-15 19:09:29] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:29] [INFO ] Computed 33 place invariants in 10 ms
[2022-05-15 19:09:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:09:30] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 232/254 places, 233/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 232/254 places, 233/239 transitions.
Incomplete random walk after 10000 steps, including 1389 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 142 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 209929 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209929 steps, saw 104985 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:34] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:09:34] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 19:09:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-15 19:09:34] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-15 19:09:34] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:09:35] [INFO ] After 1002ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-15 19:09:36] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 850 ms.
[2022-05-15 19:09:37] [INFO ] After 3399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 8038 ms.
Support contains 23 out of 232 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 233/233 transitions.
Applied a total of 0 rules in 17 ms. Remains 232 /232 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 233/233 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:45] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-15 19:09:45] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:45] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-15 19:09:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:09:47] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2022-05-15 19:09:47] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 233 rows 232 cols
[2022-05-15 19:09:47] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 19:09:47] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/232 places, 233/233 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 231 transition count 232
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 2 place count 231 transition count 219
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 28 place count 218 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 213 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 213 transition count 214
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 2 with 2 rules applied. Total rules applied 40 place count 212 transition count 213
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 212 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 210 transition count 211
Applied a total of 44 rules in 24 ms. Remains 210 /232 variables (removed 22) and now considering 211/233 (removed 22) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 211 rows 210 cols
[2022-05-15 19:09:47] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 19:09:47] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 19:09:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-05-15 19:09:47] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-15 19:09:48] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:09:48] [INFO ] After 355ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 455 ms
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 4 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:09:49] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1106 ms
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:50] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 6 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2022-05-15 19:09:51] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 2 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 10 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 3 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:09:52] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 5 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:09:53] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 3707 ms
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 767 ms
[2022-05-15 19:09:54] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-05-15 19:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:55] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 3150 ms
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 465 ms
[2022-05-15 19:09:59] [INFO ] After 11172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 934 ms.
[2022-05-15 19:10:00] [INFO ] After 12779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2022-05-15 19:10:00] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:10:00] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:10:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5060137735221426909.gal : 10 ms
[2022-05-15 19:10:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17820243880383410883.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17149677893980544994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5060137735221426909.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17820243880383410883.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17820243880383410883.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :63 after 165
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :165 after 289
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :289 after 607
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :607 after 1558
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1558 after 3461
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :3461 after 7162
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :7162 after 14558
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :14558 after 29411
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :29411 after 58994
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :58994 after 118055
Detected timeout of ITS tools.
[2022-05-15 19:10:15] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:10:15] [INFO ] Applying decomposition
[2022-05-15 19:10:15] [INFO ] Flatten gal took : 14 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/graph3492338654521514579.txt' '-o' '/tmp/graph3492338654521514579.bin' '-w' '/tmp/graph3492338654521514579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3492338654521514579.bin' '-l' '-1' '-v' '-w' '/tmp/graph3492338654521514579.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:10:15] [INFO ] Decomposing Gal with order
[2022-05-15 19:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:10:15] [INFO ] Removed a total of 181 redundant transitions.
[2022-05-15 19:10:15] [INFO ] Flatten gal took : 63 ms
[2022-05-15 19:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 16 ms.
[2022-05-15 19:10:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3997798358017816891.gal : 8 ms
[2022-05-15 19:10:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11172083970412369241.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17149677893980544994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3997798358017816891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11172083970412369241.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11172083970412369241.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :17 after 36
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :36 after 52
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :52 after 92
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :92 after 202
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :202 after 421
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :421 after 1023
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1023 after 2275
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :2275 after 4870
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :4870 after 10035
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :10035 after 20311
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :20311 after 40854
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :40854 after 81999
SDD proceeding with computation,15 properties remain. new max is 131072
SDD size :81999 after 164169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin320757010550099548
[2022-05-15 19:10:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin320757010550099548
Running compilation step : cd /tmp/ltsmin320757010550099548;'/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 454 ms.
Running link step : cd /tmp/ltsmin320757010550099548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin320757010550099548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 18 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:10:45] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:10:46] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:10:46] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:10:47] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:10:47] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-15 19:10:48] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ s393 s346), p1:(LEQ s398 s518)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 121 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-010-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-00 finished in 3496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 243 place count 404 transition count 354
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 505 place count 273 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 506 place count 272 transition count 260
Applied a total of 506 rules in 60 ms. Remains 272 /527 variables (removed 255) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:10:49] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:10:49] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:10:49] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:10:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:10:50] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2022-05-15 19:10:50] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:10:50] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:10:50] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/527 places, 260/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13877 reset in 176 ms.
Product exploration explored 100000 steps with 13875 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 760583 steps, run timeout after 3002 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 760583 steps, saw 380403 distinct states, run finished after 3002 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:10:54] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:10:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:10:54] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:10:54] [INFO ] After 117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:10:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:10:54] [INFO ] After 29ms SMT Verify possible using 17 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:10:54] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:10:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:10:54] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:10:54] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:10:54] [INFO ] After 20ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:10:54] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:10:54] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 815 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 28 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 774707 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 774707 steps, saw 387595 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2022-05-15 19:10:57] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:10:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:10:57] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:10:57] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:10:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:10:57] [INFO ] After 28ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:10:57] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:10:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:10:58] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:10:58] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:10:58] [INFO ] After 33ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:10:58] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-15 19:10:58] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 19:10:58] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 10 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 234 cols
[2022-05-15 19:10:58] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:10:58] [INFO ] Implicit Places using invariants in 270 ms returned [20, 26, 46, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 271 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 10 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:10:58] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:10:58] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:10:58] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:10:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:10:59] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 817096 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 817096 steps, saw 408632 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:11:02] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-15 19:11:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:11:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-15 19:11:03] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:11:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:11:03] [INFO ] After 49ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:03] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:11:03] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-15 19:11:03] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:03] [INFO ] After 72ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:03] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-15 19:11:03] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:11:03] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:11:03] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:11:03] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:11:03] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:11:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:11:04] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2022-05-15 19:11:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:11:04] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:11:05] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 15 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:11:05] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:11:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 19:11:05] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-15 19:11:05] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:11:05] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 19:11:05] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-15 19:11:05] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:05] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 19:11:05] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:11:05] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:05] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:05] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-15 19:11:05] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:11:05] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:05] [INFO ] Flatten gal took : 26 ms
[2022-05-15 19:11:05] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:11:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6425013596558416416.gal : 2 ms
[2022-05-15 19:11:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality959248918872226108.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7876750064060914166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6425013596558416416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality959248918872226108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality959248918872226108.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 365
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :365 after 1223
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1223 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 10117
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10117 after 21655
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21655 after 49321
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49321 after 106384
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106384 after 226480
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226480 after 471637
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :471637 after 971922
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :971922 after 1.98945e+06
Detected timeout of ITS tools.
[2022-05-15 19:11:20] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:11:20] [INFO ] Applying decomposition
[2022-05-15 19:11:20] [INFO ] Flatten gal took : 15 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/graph994083649852301665.txt' '-o' '/tmp/graph994083649852301665.bin' '-w' '/tmp/graph994083649852301665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph994083649852301665.bin' '-l' '-1' '-v' '-w' '/tmp/graph994083649852301665.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:11:20] [INFO ] Decomposing Gal with order
[2022-05-15 19:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:11:20] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-15 19:11:20] [INFO ] Flatten gal took : 28 ms
[2022-05-15 19:11:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2022-05-15 19:11:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11317437242232621413.gal : 4 ms
[2022-05-15 19:11:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14885564057532944434.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7876750064060914166;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11317437242232621413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14885564057532944434.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality14885564057532944434.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 287
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2417838533109558796
[2022-05-15 19:11:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2417838533109558796
Running compilation step : cd /tmp/ltsmin2417838533109558796;'/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 361 ms.
Running link step : cd /tmp/ltsmin2417838533109558796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2417838533109558796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:11:51] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:11:51] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:11:51] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:11:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:11:52] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2022-05-15 19:11:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:11:52] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:11:52] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 756064 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 756064 steps, saw 378142 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:11:55] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:11:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:11:56] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:11:56] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:11:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:11:56] [INFO ] After 27ms SMT Verify possible using 17 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:56] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:11:56] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:11:56] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:56] [INFO ] After 24ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:56] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 19:11:56] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 260/260 transitions.
Graph (complete) has 815 edges and 272 vertex of which 271 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 259
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 271 transition count 222
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 234 transition count 222
Applied a total of 115 rules in 21 ms. Remains 234 /272 variables (removed 38) and now considering 222/260 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/272 places, 222/260 transitions.
Incomplete random walk after 10000 steps, including 1308 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 750075 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 750075 steps, saw 375279 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 234 cols
[2022-05-15 19:11:59] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:11:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:11:59] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-15 19:11:59] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:11:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:11:59] [INFO ] After 28ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:59] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:11:59] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:11:59] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:59] [INFO ] After 35ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:59] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-15 19:11:59] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 19:11:59] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 234 cols
[2022-05-15 19:12:00] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:12:00] [INFO ] Implicit Places using invariants in 304 ms returned [20, 26, 46, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 305 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 216/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 213
Applied a total of 18 rules in 9 ms. Remains 207 /216 variables (removed 9) and now considering 213/222 (removed 9) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:00] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:12:00] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:00] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:12:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:12:01] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/234 places, 213/222 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/234 places, 213/222 transitions.
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 798278 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 798278 steps, saw 399222 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:04] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:12:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:12:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-15 19:12:04] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:12:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:12:04] [INFO ] After 48ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:12:04] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:12:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 19:12:04] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 19 ms returned sat
[2022-05-15 19:12:05] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:12:05] [INFO ] After 64ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:12:05] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-05-15 19:12:05] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:12:05] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:05] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:12:05] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:05] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:12:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:12:06] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2022-05-15 19:12:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-15 19:12:06] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:12:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 14 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:12:06] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:12:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 19:12:06] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 13 ms returned sat
[2022-05-15 19:12:06] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:12:06] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 19:12:06] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-15 19:12:06] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:12:06] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:12:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 19:12:07] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:12:07] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:12:07] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:12:07] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:12:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-15 19:12:07] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 19:12:07] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:12:07] [INFO ] Flatten gal took : 21 ms
[2022-05-15 19:12:07] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:12:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11283438565055771396.gal : 2 ms
[2022-05-15 19:12:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13049758485510218759.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13230337851880941506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11283438565055771396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13049758485510218759.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13049758485510218759.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 365
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :365 after 1223
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1223 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 10117
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10117 after 21655
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21655 after 49321
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49321 after 106384
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106384 after 226480
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226480 after 471637
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :471637 after 971922
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :971922 after 1.98945e+06
Detected timeout of ITS tools.
[2022-05-15 19:12:22] [INFO ] Flatten gal took : 14 ms
[2022-05-15 19:12:22] [INFO ] Applying decomposition
[2022-05-15 19:12:22] [INFO ] Flatten gal took : 12 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/graph16272232736515822588.txt' '-o' '/tmp/graph16272232736515822588.bin' '-w' '/tmp/graph16272232736515822588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16272232736515822588.bin' '-l' '-1' '-v' '-w' '/tmp/graph16272232736515822588.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:12:22] [INFO ] Decomposing Gal with order
[2022-05-15 19:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:12:22] [INFO ] Removed a total of 109 redundant transitions.
[2022-05-15 19:12:22] [INFO ] Flatten gal took : 26 ms
[2022-05-15 19:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2022-05-15 19:12:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality39089164370780063.gal : 4 ms
[2022-05-15 19:12:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18002670046760227536.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13230337851880941506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality39089164370780063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18002670046760227536.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality18002670046760227536.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 290
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3930517816439032309
[2022-05-15 19:12:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3930517816439032309
Running compilation step : cd /tmp/ltsmin3930517816439032309;'/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 342 ms.
Running link step : cd /tmp/ltsmin3930517816439032309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3930517816439032309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13866 reset in 100 ms.
Product exploration explored 100000 steps with 13877 reset in 103 ms.
Built C files in :
/tmp/ltsmin4560916946805576952
[2022-05-15 19:12:53] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-15 19:12:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:12:53] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-15 19:12:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:12:53] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-15 19:12:53] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:12:53] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4560916946805576952
Running compilation step : cd /tmp/ltsmin4560916946805576952;'/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 500 ms.
Running link step : cd /tmp/ltsmin4560916946805576952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4560916946805576952;'/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/stateBased15638361442627494017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:13:08] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:13:08] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:13:08] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:13:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:13:09] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2022-05-15 19:13:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 272 cols
[2022-05-15 19:13:09] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:13:09] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin6829397172293478
[2022-05-15 19:13:09] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-15 19:13:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:13:09] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-15 19:13:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:13:09] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-15 19:13:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:13:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6829397172293478
Running compilation step : cd /tmp/ltsmin6829397172293478;'/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 509 ms.
Running link step : cd /tmp/ltsmin6829397172293478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6829397172293478;'/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/stateBased12939483292449957271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:13:24] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:13:24] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:13:24] [INFO ] Time to serialize gal into /tmp/LTL17496442814592346048.gal : 1 ms
[2022-05-15 19:13:24] [INFO ] Time to serialize properties into /tmp/LTL17716342356682441523.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/LTL17496442814592346048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17716342356682441523.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/LTL1749644...268
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(p194<1)")))))
Formula 0 simplified : !FGF"(p194<1)"
Detected timeout of ITS tools.
[2022-05-15 19:13:39] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:13:39] [INFO ] Applying decomposition
[2022-05-15 19:13:39] [INFO ] Flatten gal took : 9 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/graph3311721950962930464.txt' '-o' '/tmp/graph3311721950962930464.bin' '-w' '/tmp/graph3311721950962930464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3311721950962930464.bin' '-l' '-1' '-v' '-w' '/tmp/graph3311721950962930464.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:13:39] [INFO ] Decomposing Gal with order
[2022-05-15 19:13:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:13:39] [INFO ] Removed a total of 185 redundant transitions.
[2022-05-15 19:13:39] [INFO ] Flatten gal took : 22 ms
[2022-05-15 19:13:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2022-05-15 19:13:39] [INFO ] Time to serialize gal into /tmp/LTL15959218445987644753.gal : 4 ms
[2022-05-15 19:13:39] [INFO ] Time to serialize properties into /tmp/LTL4030348823579942438.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/LTL15959218445987644753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4030348823579942438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1595921...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(i1.u16.p194<1)")))))
Formula 0 simplified : !FGF"(i1.u16.p194<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6024197729090053028
[2022-05-15 19:13:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6024197729090053028
Running compilation step : cd /tmp/ltsmin6024197729090053028;'/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 425 ms.
Running link step : cd /tmp/ltsmin6024197729090053028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6024197729090053028;'/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 DoubleExponent-PT-010-LTLCardinality-01 finished in 200764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&!(!p0 U p1))))'
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 465 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 503 place count 274 transition count 262
Applied a total of 503 rules in 33 ms. Remains 274 /527 variables (removed 253) and now considering 262/497 (removed 235) transitions.
// Phase 1: matrix 262 rows 274 cols
[2022-05-15 19:14:10] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:14:10] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 262 rows 274 cols
[2022-05-15 19:14:10] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:14:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:14:11] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2022-05-15 19:14:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 274 cols
[2022-05-15 19:14:11] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:14:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/527 places, 262/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/527 places, 262/497 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s245), p0:(GT s171 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-07 finished in 1461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X(G(G(p0))))))))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 243 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 283 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 469 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 503 place count 274 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 273 transition count 260
Applied a total of 504 rules in 55 ms. Remains 273 /527 variables (removed 254) and now considering 260/497 (removed 237) transitions.
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:14:11] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:14:11] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:14:11] [INFO ] Computed 49 place invariants in 11 ms
[2022-05-15 19:14:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:14:12] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2022-05-15 19:14:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:14:12] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-15 19:14:13] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/527 places, 260/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/527 places, 260/497 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s55 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11428 reset in 103 ms.
Product exploration explored 100000 steps with 11320 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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)]
Incomplete random walk after 10000 steps, including 1141 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 759853 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 759853 steps, saw 380039 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:14:16] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:14:16] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:14:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:14:16] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:14:16] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:14:16] [INFO ] After 58ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-05-15 19:14:16] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 19:14:16] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 260/260 transitions.
Graph (complete) has 813 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 259
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 1 with 38 rules applied. Total rules applied 40 place count 272 transition count 221
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 234 transition count 221
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 117 place count 234 transition count 221
Applied a total of 117 rules in 21 ms. Remains 234 /273 variables (removed 39) and now considering 221/260 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/273 places, 221/260 transitions.
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 769203 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 769203 steps, saw 384852 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 234 cols
[2022-05-15 19:14:19] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:14:20] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:14:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:14:20] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:14:20] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:14:20] [INFO ] After 65ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:20] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:14:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:14:20] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:14:20] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:14:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2022-05-15 19:14:20] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 19:14:20] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 221/221 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 234 cols
[2022-05-15 19:14:20] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:14:21] [INFO ] Implicit Places using invariants in 280 ms returned [20, 26, 46, 52, 73, 78, 99, 105, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 281 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 216/234 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 212
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 212
Applied a total of 18 rules in 8 ms. Remains 207 /216 variables (removed 9) and now considering 212/221 (removed 9) transitions.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:21] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:14:21] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:21] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:14:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:14:22] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/234 places, 212/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/234 places, 212/221 transitions.
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1428 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 829860 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 829860 steps, saw 415015 distinct states, run finished after 3002 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:25] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:14:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:14:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2022-05-15 19:14:25] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:14:25] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:14:25] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:14:26] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:14:26] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:14:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2022-05-15 19:14:26] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 19:14:26] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:26] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:14:26] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:26] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:14:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:14:27] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2022-05-15 19:14:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:14:27] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:14:27] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 212/212 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 184
Applied a total of 56 rules in 9 ms. Remains 179 /207 variables (removed 28) and now considering 184/212 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2022-05-15 19:14:27] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:14:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:14:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 19:14:27] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 7 ms returned sat
[2022-05-15 19:14:28] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:14:28] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:28] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:14:28] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:14:28] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:14:28] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:14:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18046249230696031671.gal : 3 ms
[2022-05-15 19:14:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13956978200080927719.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5524979110286036546;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18046249230696031671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13956978200080927719.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13956978200080927719.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 195
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :195 after 410
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :410 after 1593
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1593 after 4392
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4392 after 11354
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :11354 after 25859
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :25859 after 61213
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :61213 after 134025
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :134025 after 294045
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :294045 after 621963
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :621963 after 1.29686e+06
Detected timeout of ITS tools.
[2022-05-15 19:14:43] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:14:43] [INFO ] Applying decomposition
[2022-05-15 19:14:43] [INFO ] Flatten gal took : 9 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/graph4287492908658574041.txt' '-o' '/tmp/graph4287492908658574041.bin' '-w' '/tmp/graph4287492908658574041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4287492908658574041.bin' '-l' '-1' '-v' '-w' '/tmp/graph4287492908658574041.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:14:43] [INFO ] Decomposing Gal with order
[2022-05-15 19:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:14:43] [INFO ] Removed a total of 101 redundant transitions.
[2022-05-15 19:14:43] [INFO ] Flatten gal took : 18 ms
[2022-05-15 19:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2022-05-15 19:14:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7347465448456227030.gal : 2 ms
[2022-05-15 19:14:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1318236707737007787.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5524979110286036546;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7347465448456227030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1318236707737007787.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1318236707737007787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 50
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 103
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :103 after 215
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :215 after 747
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :747 after 3812
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3812 after 8742
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8742 after 23795
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23795 after 64452
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :64452 after 163910
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :163910 after 412126
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :412126 after 1.11031e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin283683077457646631
[2022-05-15 19:14:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin283683077457646631
Running compilation step : cd /tmp/ltsmin283683077457646631;'/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 343 ms.
Running link step : cd /tmp/ltsmin283683077457646631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin283683077457646631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:15:13] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:15:13] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:15:13] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-15 19:15:13] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:15:14] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2022-05-15 19:15:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:15:14] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:15:14] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 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)]
Incomplete random walk after 10000 steps, including 1159 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 768042 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 768042 steps, saw 384132 distinct states, run finished after 3005 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:15:18] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:15:18] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:15:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:15:18] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-15 19:15:18] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:18] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:15:18] [INFO ] After 61ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:18] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-15 19:15:18] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-15 19:15:18] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 260/260 transitions.
Graph (complete) has 813 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 259
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 1 with 38 rules applied. Total rules applied 40 place count 272 transition count 221
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 234 transition count 221
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 117 place count 234 transition count 221
Applied a total of 117 rules in 16 ms. Remains 234 /273 variables (removed 39) and now considering 221/260 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/273 places, 221/260 transitions.
Incomplete random walk after 10000 steps, including 1240 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 770614 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 770614 steps, saw 385557 distinct states, run finished after 3002 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 234 cols
[2022-05-15 19:15:21] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:15:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:15:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:15:21] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-15 19:15:22] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:15:22] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:22] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:15:22] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:15:22] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:15:22] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:15:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2022-05-15 19:15:22] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:15:22] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 221/221 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 234 cols
[2022-05-15 19:15:22] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:15:22] [INFO ] Implicit Places using invariants in 422 ms returned [20, 26, 46, 52, 73, 78, 99, 105, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 433 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 216/234 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 212
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 212
Applied a total of 18 rules in 7 ms. Remains 207 /216 variables (removed 9) and now considering 212/221 (removed 9) transitions.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:23] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:15:23] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:23] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:15:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:15:24] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/234 places, 212/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/234 places, 212/221 transitions.
Incomplete random walk after 10000 steps, including 1354 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1428 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 846953 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 846953 steps, saw 423565 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:27] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:15:27] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:15:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2022-05-15 19:15:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:15:27] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:15:27] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:27] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:15:28] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:15:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:15:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
[2022-05-15 19:15:28] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 19:15:28] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:28] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:15:28] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:28] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:15:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:15:29] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
[2022-05-15 19:15:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 212 rows 207 cols
[2022-05-15 19:15:29] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:15:29] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 212/212 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 191 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 182 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 182 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 181 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 184
Applied a total of 56 rules in 11 ms. Remains 179 /207 variables (removed 28) and now considering 184/212 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 179 cols
[2022-05-15 19:15:29] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:15:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:15:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 19:15:29] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 6 ms returned sat
[2022-05-15 19:15:30] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:15:30] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:30] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:15:30] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:15:30] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:15:30] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:15:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15460381287525953238.gal : 1 ms
[2022-05-15 19:15:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8172604016200985878.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5755041802335185424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15460381287525953238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8172604016200985878.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8172604016200985878.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 195
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :195 after 410
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :410 after 1593
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1593 after 4392
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4392 after 11354
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :11354 after 25859
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :25859 after 61213
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :61213 after 134025
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :134025 after 294045
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :294045 after 621963
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :621963 after 1.29686e+06
Detected timeout of ITS tools.
[2022-05-15 19:15:45] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:15:45] [INFO ] Applying decomposition
[2022-05-15 19:15:45] [INFO ] Flatten gal took : 9 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/graph4565659931211485049.txt' '-o' '/tmp/graph4565659931211485049.bin' '-w' '/tmp/graph4565659931211485049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4565659931211485049.bin' '-l' '-1' '-v' '-w' '/tmp/graph4565659931211485049.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:15:45] [INFO ] Decomposing Gal with order
[2022-05-15 19:15:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:15:45] [INFO ] Removed a total of 105 redundant transitions.
[2022-05-15 19:15:45] [INFO ] Flatten gal took : 29 ms
[2022-05-15 19:15:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2022-05-15 19:15:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9698221901334237957.gal : 2 ms
[2022-05-15 19:15:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18215258516883550788.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5755041802335185424;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9698221901334237957.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18215258516883550788.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18215258516883550788.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 39
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :39 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 190
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :190 after 301
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :301 after 1080
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1080 after 4267
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4267 after 11325
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :11325 after 29707
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29707 after 76532
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :76532 after 183395
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :183395 after 430973
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :430973 after 1.00401e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3996331149577457646
[2022-05-15 19:16:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3996331149577457646
Running compilation step : cd /tmp/ltsmin3996331149577457646;'/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 356 ms.
Running link step : cd /tmp/ltsmin3996331149577457646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3996331149577457646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11424 reset in 110 ms.
Product exploration explored 100000 steps with 11397 reset in 115 ms.
Built C files in :
/tmp/ltsmin13716726170611703889
[2022-05-15 19:16:15] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-15 19:16:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:15] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-15 19:16:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:15] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-15 19:16:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:15] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13716726170611703889
Running compilation step : cd /tmp/ltsmin13716726170611703889;'/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 506 ms.
Running link step : cd /tmp/ltsmin13716726170611703889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13716726170611703889;'/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/stateBased1557064271176354427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 273 /273 variables (removed 0) and now considering 260/260 (removed 0) transitions.
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:16:31] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:16:31] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:16:31] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:16:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 19:16:32] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2022-05-15 19:16:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 273 cols
[2022-05-15 19:16:32] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:16:32] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin2801747621874798080
[2022-05-15 19:16:32] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-15 19:16:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:32] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-15 19:16:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:32] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-15 19:16:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:16:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2801747621874798080
Running compilation step : cd /tmp/ltsmin2801747621874798080;'/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 514 ms.
Running link step : cd /tmp/ltsmin2801747621874798080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2801747621874798080;'/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/stateBased16795837896144506800.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:16:47] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:16:47] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:16:47] [INFO ] Time to serialize gal into /tmp/LTL11997992442554920968.gal : 1 ms
[2022-05-15 19:16:47] [INFO ] Time to serialize properties into /tmp/LTL18224145370377125494.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/LTL11997992442554920968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18224145370377125494.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/LTL1199799...268
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(G(G("(p194<=p28)")))))))))
Formula 0 simplified : !GXGFXG"(p194<=p28)"
Detected timeout of ITS tools.
[2022-05-15 19:17:02] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:17:02] [INFO ] Applying decomposition
[2022-05-15 19:17:02] [INFO ] Flatten gal took : 7 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/graph16283152234325943309.txt' '-o' '/tmp/graph16283152234325943309.bin' '-w' '/tmp/graph16283152234325943309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16283152234325943309.bin' '-l' '-1' '-v' '-w' '/tmp/graph16283152234325943309.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:17:02] [INFO ] Decomposing Gal with order
[2022-05-15 19:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:17:02] [INFO ] Removed a total of 179 redundant transitions.
[2022-05-15 19:17:02] [INFO ] Flatten gal took : 19 ms
[2022-05-15 19:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2022-05-15 19:17:02] [INFO ] Time to serialize gal into /tmp/LTL570248366263575389.gal : 3 ms
[2022-05-15 19:17:02] [INFO ] Time to serialize properties into /tmp/LTL16590609539403441212.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/LTL570248366263575389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16590609539403441212.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/LTL5702483...266
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(G(G("(gu19.p194<=gu19.p28)")))))))))
Formula 0 simplified : !GXGFXG"(gu19.p194<=gu19.p28)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin577900496183743530
[2022-05-15 19:17:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577900496183743530
Running compilation step : cd /tmp/ltsmin577900496183743530;'/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 427 ms.
Running link step : cd /tmp/ltsmin577900496183743530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin577900496183743530;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X([]([]((LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-08 finished in 201299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(X(p1))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 18 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:17:32] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-15 19:17:33] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:17:33] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:17:34] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:17:34] [INFO ] Computed 49 place invariants in 17 ms
[2022-05-15 19:17:35] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s185 s296), p1:(LEQ s250 s292)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3304 reset in 224 ms.
Product exploration explored 100000 steps with 3295 reset in 275 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 254128 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254128 steps, saw 127084 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:17:39] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-15 19:17:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:17:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:17:39] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 19:17:40] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:40] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-15 19:17:40] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2022-05-15 19:17:40] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2022-05-15 19:17:41] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 1 ms to minimize.
[2022-05-15 19:17:41] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 0 ms to minimize.
[2022-05-15 19:17:41] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:17:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 724 ms
[2022-05-15 19:17:41] [INFO ] After 1651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 239 ms.
[2022-05-15 19:17:41] [INFO ] After 2010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 397 ms.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 240 place count 406 transition count 355
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 282 place count 385 transition count 355
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 500 place count 276 transition count 264
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 539 place count 276 transition count 225
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 578 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 4 with 39 rules applied. Total rules applied 617 place count 237 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 618 place count 236 transition count 224
Applied a total of 618 rules in 47 ms. Remains 236 /527 variables (removed 291) and now considering 224/497 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/527 places, 224/497 transitions.
Incomplete random walk after 10000 steps, including 1237 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 259039 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259039 steps, saw 129578 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:17:45] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:17:45] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:17:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:17:45] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2022-05-15 19:17:45] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:17:46] [INFO ] After 117ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:17:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 514 ms
[2022-05-15 19:17:46] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-15 19:17:46] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 137 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:17:46] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:17:47] [INFO ] Implicit Places using invariants in 205 ms returned [20, 26, 46, 51, 100, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 219 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 220/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 217
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 213 transition count 217
Applied a total of 14 rules in 7 ms. Remains 213 /220 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:47] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:17:47] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:47] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:17:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:17:49] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/236 places, 217/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/236 places, 217/224 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 346449 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346449 steps, saw 173256 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:52] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 19:17:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:17:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 19:17:53] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:17:53] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:17:53] [INFO ] After 120ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:53] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:17:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:17:53] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:17:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2022-05-15 19:17:53] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-15 19:17:53] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:53] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:17:53] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:53] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:17:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:17:56] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
[2022-05-15 19:17:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:17:56] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 19:17:56] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 213 transition count 199
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 195 transition count 199
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 187 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 187 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 186 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 186 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 184 transition count 188
Applied a total of 58 rules in 10 ms. Remains 184 /213 variables (removed 29) and now considering 188/217 (removed 29) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 184 cols
[2022-05-15 19:17:56] [INFO ] Computed 33 place invariants in 12 ms
[2022-05-15 19:17:56] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:17:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 19:17:56] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:17:56] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:17:56] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:56] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-15 19:17:56] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-15 19:17:56] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:17:56] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:17:56] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:17:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3549967277333212433.gal : 1 ms
[2022-05-15 19:17:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3123711454477959966.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1315688746241627704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3549967277333212433.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3123711454477959966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3123711454477959966.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 159
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :159 after 297
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :297 after 583
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :583 after 1408
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1408 after 3167
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2022-05-15 19:18:11] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:18:11] [INFO ] Applying decomposition
[2022-05-15 19:18:11] [INFO ] Flatten gal took : 8 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/graph4131657704562884607.txt' '-o' '/tmp/graph4131657704562884607.bin' '-w' '/tmp/graph4131657704562884607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4131657704562884607.bin' '-l' '-1' '-v' '-w' '/tmp/graph4131657704562884607.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:18:11] [INFO ] Decomposing Gal with order
[2022-05-15 19:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:18:11] [INFO ] Removed a total of 122 redundant transitions.
[2022-05-15 19:18:11] [INFO ] Flatten gal took : 17 ms
[2022-05-15 19:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 2 ms.
[2022-05-15 19:18:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9952922650702781033.gal : 2 ms
[2022-05-15 19:18:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3367898358017478372.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1315688746241627704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9952922650702781033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3367898358017478372.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3367898358017478372.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 162
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :162 after 309
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :309 after 653
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :653 after 1661
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1661 after 3710
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3710 after 7885
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7885 after 16186
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :16186 after 32774
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :32774 after 66005
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :66005 after 132365
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10936013034930755868
[2022-05-15 19:18:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10936013034930755868
Running compilation step : cd /tmp/ltsmin10936013034930755868;'/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 340 ms.
Running link step : cd /tmp/ltsmin10936013034930755868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10936013034930755868;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:18:42] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:18:42] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:18:42] [INFO ] Computed 49 place invariants in 17 ms
[2022-05-15 19:18:44] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:18:44] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:18:44] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 239512 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239512 steps, saw 119768 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:18:48] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:18:48] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:18:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 19:18:48] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-15 19:18:49] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:18:49] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 0 ms to minimize.
[2022-05-15 19:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-15 19:18:49] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2022-05-15 19:18:49] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 0 ms to minimize.
[2022-05-15 19:18:49] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2022-05-15 19:18:49] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 0 ms to minimize.
[2022-05-15 19:18:50] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2022-05-15 19:18:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 737 ms
[2022-05-15 19:18:50] [INFO ] After 1670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 247 ms.
[2022-05-15 19:18:50] [INFO ] After 2041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 373 ms.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 406 transition count 376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 240 place count 406 transition count 355
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 282 place count 385 transition count 355
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 500 place count 276 transition count 264
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 539 place count 276 transition count 225
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 578 place count 237 transition count 225
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 4 with 39 rules applied. Total rules applied 617 place count 237 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 618 place count 236 transition count 224
Applied a total of 618 rules in 41 ms. Remains 236 /527 variables (removed 291) and now considering 224/497 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/527 places, 224/497 transitions.
Incomplete random walk after 10000 steps, including 1308 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 268265 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268265 steps, saw 134204 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:18:54] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:18:54] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:18:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:18:54] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2022-05-15 19:18:54] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:18:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:18:54] [INFO ] After 119ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:18:54] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:18:54] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:18:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:18:55] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:18:55] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:18:55] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:18:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 467 ms
[2022-05-15 19:18:55] [INFO ] After 722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-05-15 19:18:55] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 216 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:18:55] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:18:55] [INFO ] Implicit Places using invariants in 210 ms returned [20, 26, 46, 51, 100, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 211 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 220/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 217
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 213 transition count 217
Applied a total of 14 rules in 6 ms. Remains 213 /220 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:18:55] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:18:56] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:18:56] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:18:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:18:58] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/236 places, 217/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/236 places, 217/224 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 284836 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284836 steps, saw 142445 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:19:01] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:19:01] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:19:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-15 19:19:01] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:19:01] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:19:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:19:01] [INFO ] After 108ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:19:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:19:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:19:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:19:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2022-05-15 19:19:02] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-15 19:19:02] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 191 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:19:02] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-15 19:19:02] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:19:02] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 19:19:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:19:04] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2022-05-15 19:19:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:19:04] [INFO ] Computed 33 place invariants in 12 ms
[2022-05-15 19:19:04] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 213 transition count 199
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 195 transition count 199
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 187 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 187 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 186 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 186 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 184 transition count 188
Applied a total of 58 rules in 11 ms. Remains 184 /213 variables (removed 29) and now considering 188/217 (removed 29) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 184 cols
[2022-05-15 19:19:04] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:19:04] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:19:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 19:19:04] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:19:04] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:19:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:19:05] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:19:05] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-15 19:19:05] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-15 19:19:05] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:19:05] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:19:05] [INFO ] Flatten gal took : 7 ms
[2022-05-15 19:19:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7404723447009521260.gal : 3 ms
[2022-05-15 19:19:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12965659195647687876.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13127260170770612688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7404723447009521260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12965659195647687876.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12965659195647687876.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 159
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :159 after 297
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :297 after 583
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :583 after 1408
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1408 after 3167
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2022-05-15 19:19:20] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:19:20] [INFO ] Applying decomposition
[2022-05-15 19:19:20] [INFO ] Flatten gal took : 8 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/graph13414174054361017514.txt' '-o' '/tmp/graph13414174054361017514.bin' '-w' '/tmp/graph13414174054361017514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13414174054361017514.bin' '-l' '-1' '-v' '-w' '/tmp/graph13414174054361017514.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:19:20] [INFO ] Decomposing Gal with order
[2022-05-15 19:19:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:19:20] [INFO ] Removed a total of 131 redundant transitions.
[2022-05-15 19:19:20] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:19:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2022-05-15 19:19:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12898727281531298933.gal : 2 ms
[2022-05-15 19:19:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5472675829087277617.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13127260170770612688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12898727281531298933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5472675829087277617.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5472675829087277617.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :159 after 305
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :305 after 642
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :642 after 1501
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1501 after 3349
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3349 after 7037
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7037 after 14352
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :14352 after 29045
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :29045 after 58310
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :58310 after 116917
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4541230922872269466
[2022-05-15 19:19:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4541230922872269466
Running compilation step : cd /tmp/ltsmin4541230922872269466;'/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 336 ms.
Running link step : cd /tmp/ltsmin4541230922872269466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4541230922872269466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3304 reset in 116 ms.
Product exploration explored 100000 steps with 3325 reset in 129 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 526 transition count 496
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 117 place count 526 transition count 515
Deduced a syphon composed of 138 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 139 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 143 place count 522 transition count 511
Deduced a syphon composed of 134 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 147 place count 522 transition count 511
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 238 place count 522 transition count 529
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 521 transition count 528
Deduced a syphon composed of 224 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 521 transition count 528
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 244 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 260 place count 521 transition count 649
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 281 place count 500 transition count 607
Deduced a syphon composed of 223 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 302 place count 500 transition count 607
Deduced a syphon composed of 223 places in 1 ms
Applied a total of 302 rules in 138 ms. Remains 500 /527 variables (removed 27) and now considering 607/497 (removed -110) transitions.
[2022-05-15 19:19:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 607 rows 500 cols
[2022-05-15 19:19:51] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:19:51] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 607/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/527 places, 607/497 transitions.
Product exploration explored 100000 steps with 10863 reset in 449 ms.
Product exploration explored 100000 steps with 10786 reset in 469 ms.
Built C files in :
/tmp/ltsmin3185951455178696657
[2022-05-15 19:19:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3185951455178696657
Running compilation step : cd /tmp/ltsmin3185951455178696657;'/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 761 ms.
Running link step : cd /tmp/ltsmin3185951455178696657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3185951455178696657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3181280441510509173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 19 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:20:08] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:20:08] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:20:08] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:20:09] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:20:09] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-15 19:20:10] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin11700671457339433987
[2022-05-15 19:20:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11700671457339433987
Running compilation step : cd /tmp/ltsmin11700671457339433987;'/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 742 ms.
Running link step : cd /tmp/ltsmin11700671457339433987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11700671457339433987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7329185236133978053.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:20:25] [INFO ] Flatten gal took : 20 ms
[2022-05-15 19:20:25] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:20:25] [INFO ] Time to serialize gal into /tmp/LTL2475173353460781654.gal : 1 ms
[2022-05-15 19:20:25] [INFO ] Time to serialize properties into /tmp/LTL1336335736116191870.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/LTL2475173353460781654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1336335736116191870.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/LTL2475173...266
Read 1 LTL properties
Checking formula 0 : !(((F("(p266>p366)"))||(G(X("(p324<=p362)")))))
Formula 0 simplified : !(F"(p266>p366)" | GX"(p324<=p362)")
Detected timeout of ITS tools.
[2022-05-15 19:20:40] [INFO ] Flatten gal took : 25 ms
[2022-05-15 19:20:40] [INFO ] Applying decomposition
[2022-05-15 19:20:40] [INFO ] Flatten gal took : 12 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/graph9677652384036476027.txt' '-o' '/tmp/graph9677652384036476027.bin' '-w' '/tmp/graph9677652384036476027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9677652384036476027.bin' '-l' '-1' '-v' '-w' '/tmp/graph9677652384036476027.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:20:40] [INFO ] Decomposing Gal with order
[2022-05-15 19:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:20:40] [INFO ] Removed a total of 144 redundant transitions.
[2022-05-15 19:20:40] [INFO ] Flatten gal took : 27 ms
[2022-05-15 19:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2022-05-15 19:20:40] [INFO ] Time to serialize gal into /tmp/LTL11331141641474524061.gal : 5 ms
[2022-05-15 19:20:40] [INFO ] Time to serialize properties into /tmp/LTL10603990714548307830.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/LTL11331141641474524061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10603990714548307830.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/LTL1133114...268
Read 1 LTL properties
Checking formula 0 : !(((F("(gu126.p266>gu126.p366)"))||(G(X("(gu107.p324<=gu107.p362)")))))
Formula 0 simplified : !(F"(gu126.p266>gu126.p366)" | GX"(gu107.p324<=gu107.p362)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1022493410307829905
[2022-05-15 19:20:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1022493410307829905
Running compilation step : cd /tmp/ltsmin1022493410307829905;'/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 694 ms.
Running link step : cd /tmp/ltsmin1022493410307829905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1022493410307829905;'/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))||[](X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 217848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X(p0))))))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 12 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:21:10] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:21:10] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:21:10] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:21:12] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:21:12] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-15 19:21:12] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s458 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3301 reset in 129 ms.
Product exploration explored 100000 steps with 3296 reset in 130 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538109 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538109 steps, saw 269088 distinct states, run finished after 3005 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:21:16] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:21:16] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:21:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:21:16] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:21:17] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:17] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 19:21:17] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 254 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 242 place count 405 transition count 354
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 470 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 506 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 543 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 43 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 764957 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 764957 steps, saw 382718 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:21:21] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:21:21] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:21:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:21:21] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 19:21:21] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:21:21] [INFO ] After 144ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:21:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:21:22] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:21:22] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:21:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 609 ms
[2022-05-15 19:21:22] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-15 19:21:22] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:21:22] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:21:22] [INFO ] Implicit Places using invariants in 383 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 384 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 6 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:22] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:21:22] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:22] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:21:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:21:24] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 849050 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 849050 steps, saw 424605 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:27] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:21:27] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:21:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 19:21:27] [INFO ] [Nat]Absence check using 9 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-15 19:21:27] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:21:27] [INFO ] After 183ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:27] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:21:28] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:28] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:21:28] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:28] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:21:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:21:29] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2022-05-15 19:21:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:21:29] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:21:29] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 12 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:21:29] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-15 19:21:29] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:21:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:21:29] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-15 19:21:29] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:21:29] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:30] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2022-05-15 19:21:30] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:21:30] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:21:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 204 ms
[2022-05-15 19:21:30] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 19:21:30] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:21:30] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:21:30] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:21:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality816183770099613494.gal : 1 ms
[2022-05-15 19:21:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2635690994276234143.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16910295620749959501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality816183770099613494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2635690994276234143.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality2635690994276234143.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 295
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :295 after 1022
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1022 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 8682
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8682 after 19593
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19593 after 43691
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :43691 after 94868
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :94868 after 201603
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :201603 after 418827
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :418827 after 881957
Detected timeout of ITS tools.
[2022-05-15 19:21:45] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:21:45] [INFO ] Applying decomposition
[2022-05-15 19:21:45] [INFO ] Flatten gal took : 10 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/graph4311833481968476177.txt' '-o' '/tmp/graph4311833481968476177.bin' '-w' '/tmp/graph4311833481968476177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4311833481968476177.bin' '-l' '-1' '-v' '-w' '/tmp/graph4311833481968476177.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:21:45] [INFO ] Decomposing Gal with order
[2022-05-15 19:21:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:21:45] [INFO ] Removed a total of 106 redundant transitions.
[2022-05-15 19:21:45] [INFO ] Flatten gal took : 39 ms
[2022-05-15 19:21:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2022-05-15 19:21:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7247433124049934120.gal : 2 ms
[2022-05-15 19:21:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4058456021579793785.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16910295620749959501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7247433124049934120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4058456021579793785.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4058456021579793785.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 367
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :367 after 1922
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1922 after 3842
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3842 after 16757
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16757 after 38968
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :38968 after 102246
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :102246 after 276802
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :276802 after 741805
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :741805 after 2.06853e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12244016783573994960
[2022-05-15 19:22:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12244016783573994960
Running compilation step : cd /tmp/ltsmin12244016783573994960;'/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 343 ms.
Running link step : cd /tmp/ltsmin12244016783573994960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12244016783573994960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 14 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:22:16] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:22:16] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:22:16] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:22:17] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:22:17] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:22:18] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 539062 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 539062 steps, saw 269568 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:22:21] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:22:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:22:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:22:21] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-15 19:22:21] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:22] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 19:22:22] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 251 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 242 place count 405 transition count 354
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 470 place count 291 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 506 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 543 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 580 place count 236 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 34 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/527 places, 223/497 transitions.
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 772734 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :{}
Probabilistic random walk after 772734 steps, saw 386612 distinct states, run finished after 3007 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:22:25] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:22:25] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:22:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:22:25] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 19:22:25] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:22:26] [INFO ] After 143ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:22:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 551 ms
[2022-05-15 19:22:26] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-15 19:22:26] [INFO ] After 968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 104 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:22:26] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:22:27] [INFO ] Implicit Places using invariants in 307 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 308 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 7 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:27] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:22:27] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:27] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:22:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:22:28] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 842157 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 842157 steps, saw 421160 distinct states, run finished after 3005 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:31] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:22:31] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:22:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-15 19:22:31] [INFO ] [Nat]Absence check using 9 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-15 19:22:31] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:22:32] [INFO ] After 186ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:32] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-15 19:22:32] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:32] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:22:32] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:32] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:22:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:22:33] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2022-05-15 19:22:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:22:33] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:22:34] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 10 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:22:34] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-15 19:22:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:22:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:22:34] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-15 19:22:34] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:22:34] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:34] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:22:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:22:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:22:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2022-05-15 19:22:34] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 19:22:34] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:22:34] [INFO ] Flatten gal took : 14 ms
[2022-05-15 19:22:34] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:22:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8670247010614459777.gal : 1 ms
[2022-05-15 19:22:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5950035278519239987.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms616222278622583228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8670247010614459777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5950035278519239987.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5950035278519239987.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 295
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :295 after 1022
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1022 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 8682
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8682 after 19593
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19593 after 43691
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :43691 after 94868
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :94868 after 201603
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :201603 after 418827
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :418827 after 881957
Detected timeout of ITS tools.
[2022-05-15 19:22:49] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:22:49] [INFO ] Applying decomposition
[2022-05-15 19:22:49] [INFO ] Flatten gal took : 14 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/graph9959091181315639144.txt' '-o' '/tmp/graph9959091181315639144.bin' '-w' '/tmp/graph9959091181315639144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9959091181315639144.bin' '-l' '-1' '-v' '-w' '/tmp/graph9959091181315639144.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:22:49] [INFO ] Decomposing Gal with order
[2022-05-15 19:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:22:49] [INFO ] Removed a total of 102 redundant transitions.
[2022-05-15 19:22:49] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2022-05-15 19:22:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8286271010131701491.gal : 2 ms
[2022-05-15 19:22:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1242239907031501886.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms616222278622583228;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8286271010131701491.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1242239907031501886.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1242239907031501886.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 347
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :347 after 1536
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1536 after 3556
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3556 after 14209
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14209 after 35595
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35595 after 93791
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93791 after 246605
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246605 after 625825
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :625825 after 1.69136e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6667412771845793626
[2022-05-15 19:23:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667412771845793626
Running compilation step : cd /tmp/ltsmin6667412771845793626;'/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 346 ms.
Running link step : cd /tmp/ltsmin6667412771845793626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin6667412771845793626;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3287 reset in 118 ms.
Product exploration explored 100000 steps with 3312 reset in 120 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 496
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 118 place count 526 transition count 515
Deduced a syphon composed of 139 places in 3 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 140 place count 526 transition count 515
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 522 transition count 511
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 522 transition count 511
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 228 places in 2 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 241 place count 522 transition count 531
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 242 place count 521 transition count 530
Deduced a syphon composed of 227 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 243 place count 521 transition count 530
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 263 place count 521 transition count 652
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 284 place count 500 transition count 610
Deduced a syphon composed of 226 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 305 place count 500 transition count 610
Deduced a syphon composed of 226 places in 1 ms
Applied a total of 305 rules in 59 ms. Remains 500 /527 variables (removed 27) and now considering 610/497 (removed -113) transitions.
[2022-05-15 19:23:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 610 rows 500 cols
[2022-05-15 19:23:21] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-15 19:23:21] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 610/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/527 places, 610/497 transitions.
Product exploration explored 100000 steps with 8869 reset in 387 ms.
Product exploration explored 100000 steps with 8901 reset in 376 ms.
Built C files in :
/tmp/ltsmin17267072000528137544
[2022-05-15 19:23:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17267072000528137544
Running compilation step : cd /tmp/ltsmin17267072000528137544;'/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 701 ms.
Running link step : cd /tmp/ltsmin17267072000528137544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17267072000528137544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16164843430887033336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 15 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:23:37] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-15 19:23:37] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:23:37] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-15 19:23:39] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:23:39] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:23:39] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin3927212849976351526
[2022-05-15 19:23:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3927212849976351526
Running compilation step : cd /tmp/ltsmin3927212849976351526;'/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 764 ms.
Running link step : cd /tmp/ltsmin3927212849976351526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3927212849976351526;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8570223236717437720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:23:54] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:23:54] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:23:54] [INFO ] Time to serialize gal into /tmp/LTL11157653054277256326.gal : 4 ms
[2022-05-15 19:23:54] [INFO ] Time to serialize properties into /tmp/LTL15541754004427359595.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/LTL11157653054277256326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15541754004427359595.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/LTL1115765...268
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(X("(p515<=p151)")))))))
Formula 0 simplified : !GXXGX"(p515<=p151)"
Detected timeout of ITS tools.
[2022-05-15 19:24:09] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:24:09] [INFO ] Applying decomposition
[2022-05-15 19:24:09] [INFO ] Flatten gal took : 11 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/graph12084547674662299060.txt' '-o' '/tmp/graph12084547674662299060.bin' '-w' '/tmp/graph12084547674662299060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12084547674662299060.bin' '-l' '-1' '-v' '-w' '/tmp/graph12084547674662299060.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:24:09] [INFO ] Decomposing Gal with order
[2022-05-15 19:24:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:24:09] [INFO ] Removed a total of 135 redundant transitions.
[2022-05-15 19:24:09] [INFO ] Flatten gal took : 24 ms
[2022-05-15 19:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2022-05-15 19:24:09] [INFO ] Time to serialize gal into /tmp/LTL6070315427333728123.gal : 3 ms
[2022-05-15 19:24:09] [INFO ] Time to serialize properties into /tmp/LTL10210683755226838314.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/LTL6070315427333728123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10210683755226838314.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/LTL6070315...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(X("(gu27.p515<=gu27.p151)")))))))
Formula 0 simplified : !GXXGX"(gu27.p515<=gu27.p151)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12130903869240091143
[2022-05-15 19:24:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12130903869240091143
Running compilation step : cd /tmp/ltsmin12130903869240091143;'/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 747 ms.
Running link step : cd /tmp/ltsmin12130903869240091143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12130903869240091143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 209198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:39] [INFO ] Computed 49 place invariants in 21 ms
[2022-05-15 19:24:40] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:40] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-15 19:24:41] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:41] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:24:41] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s296 s237)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 233 ms.
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-010-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-12 finished in 2670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(!(!G(F(p0)) U G(p0)))) U p1))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:42] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-15 19:24:42] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:42] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:24:44] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:44] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:24:44] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s392 s344), p0:(LEQ s383 s369)], nbAcceptance=1, 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 3329 reset in 102 ms.
Product exploration explored 100000 steps with 3304 reset in 164 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 340918 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340918 steps, saw 170496 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:24:49] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-15 19:24:49] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:24:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:24:49] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-15 19:24:49] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:24:49] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-15 19:24:50] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-15 19:24:50] [INFO ] After 971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 772 ms.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 244 place count 404 transition count 354
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 498 place count 277 transition count 264
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 535 place count 277 transition count 227
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 572 place count 240 transition count 227
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 612 place count 240 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 613 place count 239 transition count 226
Applied a total of 613 rules in 38 ms. Remains 239 /527 variables (removed 288) and now considering 226/497 (removed 271) transitions.
Finished structural reductions, in 1 iterations. Remains : 239/527 places, 226/497 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 791 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 457406 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457406 steps, saw 228850 distinct states, run finished after 3002 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 239 cols
[2022-05-15 19:24:54] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:24:54] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:24:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 19:24:54] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 10 ms returned sat
[2022-05-15 19:24:54] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:24:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:24:54] [INFO ] After 136ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:24:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 418 ms
[2022-05-15 19:24:54] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 19:24:55] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 406 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 239/239 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 239/239 places, 226/226 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 239/239 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 239 cols
[2022-05-15 19:24:55] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:24:55] [INFO ] Implicit Places using invariants in 288 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 156, 181, 188, 195, 230, 236]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 289 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 221/239 places, 226/226 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 221 transition count 218
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 213 transition count 218
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 213 transition count 218
Applied a total of 17 rules in 11 ms. Remains 213 /221 variables (removed 8) and now considering 218/226 (removed 8) transitions.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:24:55] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:24:55] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:24:55] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:24:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:24:56] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/239 places, 218/226 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/239 places, 218/226 transitions.
Incomplete random walk after 10000 steps, including 1484 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 423414 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423414 steps, saw 211743 distinct states, run finished after 3003 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:25:00] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:25:00] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:25:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2022-05-15 19:25:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:25:00] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:25:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:25:00] [INFO ] After 104ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:25:00] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:25:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1051 ms
[2022-05-15 19:25:01] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-15 19:25:01] [INFO ] After 1462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 342 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 218/218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:25:01] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:25:02] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:25:02] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:25:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:25:03] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2022-05-15 19:25:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:25:03] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:25:03] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 218/218 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 212 transition count 217
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2 place count 212 transition count 200
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 195 transition count 200
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 188 transition count 193
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 188 transition count 193
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 2 with 2 rules applied. Total rules applied 52 place count 187 transition count 192
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 187 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 185 transition count 190
Applied a total of 56 rules in 14 ms. Remains 185 /213 variables (removed 28) and now considering 190/218 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 185 cols
[2022-05-15 19:25:03] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:25:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:25:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:25:03] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-15 19:25:03] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:25:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:25:03] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:25:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-15 19:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-05-15 19:25:03] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-15 19:25:03] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:25:03] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:25:03] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:25:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15707157944724328552.gal : 1 ms
[2022-05-15 19:25:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8279880220697099639.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14199218987370301584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15707157944724328552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8279880220697099639.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8279880220697099639.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :50314 after 106695
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :106695 after 224080
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :224080 after 461196
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :461196 after 942753
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :942753 after 1.91193e+06
Detected timeout of ITS tools.
[2022-05-15 19:25:18] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:25:18] [INFO ] Applying decomposition
[2022-05-15 19:25:18] [INFO ] Flatten gal took : 8 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/graph13358435164675191569.txt' '-o' '/tmp/graph13358435164675191569.bin' '-w' '/tmp/graph13358435164675191569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13358435164675191569.bin' '-l' '-1' '-v' '-w' '/tmp/graph13358435164675191569.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:25:18] [INFO ] Decomposing Gal with order
[2022-05-15 19:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:25:18] [INFO ] Removed a total of 104 redundant transitions.
[2022-05-15 19:25:18] [INFO ] Flatten gal took : 35 ms
[2022-05-15 19:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2022-05-15 19:25:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11022241494867598391.gal : 12 ms
[2022-05-15 19:25:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7010412986897999368.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14199218987370301584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11022241494867598391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7010412986897999368.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7010412986897999368.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 367
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :367 after 2082
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2082 after 3854
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3854 after 16757
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16757 after 41783
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :41783 after 119202
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :119202 after 318807
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :318807 after 857620
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17742889768681690320
[2022-05-15 19:25:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17742889768681690320
Running compilation step : cd /tmp/ltsmin17742889768681690320;'/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 352 ms.
Running link step : cd /tmp/ltsmin17742889768681690320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17742889768681690320;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:25:49] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-15 19:25:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 19:25:49] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2022-05-15 19:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:25:52] [INFO ] [Real]Absence check using state equation in 2541 ms returned sat
[2022-05-15 19:25:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:25:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:25:54] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2022-05-15 19:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:25:56] [INFO ] [Nat]Absence check using state equation in 2049 ms returned sat
[2022-05-15 19:25:56] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2022-05-15 19:25:56] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2022-05-15 19:25:56] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 0 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 0 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2022-05-15 19:25:57] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2022-05-15 19:25:58] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:25:58] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:25:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1838 ms
[2022-05-15 19:25:58] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-15 19:26:05] [INFO ] Added : 494 causal constraints over 99 iterations in 7395 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 9 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:26:05] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:26:05] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:26:05] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-15 19:26:07] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:26:07] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-15 19:26:07] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Incomplete random walk after 10000 steps, including 334 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294144 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294144 steps, saw 147105 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:26:11] [INFO ] Computed 49 place invariants in 44 ms
[2022-05-15 19:26:11] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:26:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:26:11] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:26:11] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:11] [INFO ] Deduced a trap composed of 108 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-15 19:26:12] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-15 19:26:12] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 390 ms.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 405 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 244 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 498 place count 277 transition count 264
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 535 place count 277 transition count 227
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 572 place count 240 transition count 227
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 612 place count 240 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 613 place count 239 transition count 226
Applied a total of 613 rules in 44 ms. Remains 239 /527 variables (removed 288) and now considering 226/497 (removed 271) transitions.
Finished structural reductions, in 1 iterations. Remains : 239/527 places, 226/497 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 397127 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397127 steps, saw 198680 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 226 rows 239 cols
[2022-05-15 19:26:15] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:26:15] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 19:26:16] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 10 ms returned sat
[2022-05-15 19:26:16] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:16] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:26:16] [INFO ] After 131ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:26:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 367 ms
[2022-05-15 19:26:16] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 19:26:16] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 361 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 239/239 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 239/239 places, 226/226 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 239/239 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 226/226 (removed 0) transitions.
// Phase 1: matrix 226 rows 239 cols
[2022-05-15 19:26:17] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:26:17] [INFO ] Implicit Places using invariants in 297 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 156, 181, 188, 195, 230, 236]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 302 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 221/239 places, 226/226 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 221 transition count 218
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 213 transition count 218
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 213 transition count 218
Applied a total of 17 rules in 12 ms. Remains 213 /221 variables (removed 8) and now considering 218/226 (removed 8) transitions.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:17] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:26:17] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:17] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:26:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:26:18] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/239 places, 218/226 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/239 places, 218/226 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 398671 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398671 steps, saw 199371 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:21] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:26:21] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:26:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2022-05-15 19:26:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:26:22] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:26:22] [INFO ] After 119ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2022-05-15 19:26:22] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:26:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2022-05-15 19:26:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:26:23] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-15 19:26:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1087 ms
[2022-05-15 19:26:23] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-15 19:26:23] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 364 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 218/218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:23] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:26:23] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:23] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:26:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 19:26:24] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2022-05-15 19:26:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 218 rows 213 cols
[2022-05-15 19:26:24] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:26:24] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 218/218 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 212 transition count 217
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2 place count 212 transition count 200
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 195 transition count 200
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 188 transition count 193
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 188 transition count 193
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 2 with 2 rules applied. Total rules applied 52 place count 187 transition count 192
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 187 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 185 transition count 190
Applied a total of 56 rules in 10 ms. Remains 185 /213 variables (removed 28) and now considering 190/218 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 185 cols
[2022-05-15 19:26:25] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:26:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:26:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:26:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-15 19:26:25] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:26:25] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2022-05-15 19:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-15 19:26:25] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-15 19:26:25] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 19:26:25] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:26:25] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:26:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15797079348477471919.gal : 1 ms
[2022-05-15 19:26:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13270522427536898465.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8492535377849805870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15797079348477471919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13270522427536898465.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13270522427536898465.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :50314 after 106695
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :106695 after 224080
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :224080 after 461196
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :461196 after 942753
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :942753 after 1.91193e+06
Detected timeout of ITS tools.
[2022-05-15 19:26:40] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:26:40] [INFO ] Applying decomposition
[2022-05-15 19:26:40] [INFO ] Flatten gal took : 8 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/graph7902843007653918514.txt' '-o' '/tmp/graph7902843007653918514.bin' '-w' '/tmp/graph7902843007653918514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7902843007653918514.bin' '-l' '-1' '-v' '-w' '/tmp/graph7902843007653918514.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:26:40] [INFO ] Decomposing Gal with order
[2022-05-15 19:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:26:40] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-15 19:26:40] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2022-05-15 19:26:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17163602877579957064.gal : 2 ms
[2022-05-15 19:26:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality834602068760850394.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8492535377849805870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17163602877579957064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality834602068760850394.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality834602068760850394.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :171 after 274
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :274 after 1265
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1265 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 14468
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14468 after 35595
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35595 after 104805
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :104805 after 318849
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :318849 after 899619
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :899619 after 2.65501e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2959653074159161081
[2022-05-15 19:26:55] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2959653074159161081
Running compilation step : cd /tmp/ltsmin2959653074159161081;'/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 346 ms.
Running link step : cd /tmp/ltsmin2959653074159161081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2959653074159161081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:27:11] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-15 19:27:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:27:11] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 19 ms returned sat
[2022-05-15 19:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:27:13] [INFO ] [Real]Absence check using state equation in 2435 ms returned sat
[2022-05-15 19:27:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:27:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:27:14] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 16 ms returned sat
[2022-05-15 19:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:27:16] [INFO ] [Nat]Absence check using state equation in 1961 ms returned sat
[2022-05-15 19:27:16] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:27:16] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2022-05-15 19:27:16] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2022-05-15 19:27:16] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2022-05-15 19:27:16] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:27:17] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 1 ms to minimize.
[2022-05-15 19:27:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1921 ms
[2022-05-15 19:27:18] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-15 19:27:25] [INFO ] Added : 494 causal constraints over 99 iterations in 7196 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Product exploration explored 100000 steps with 3334 reset in 112 ms.
Product exploration explored 100000 steps with 3311 reset in 128 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), p0]
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 526 transition count 496
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 119 place count 526 transition count 514
Deduced a syphon composed of 139 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 140 place count 526 transition count 514
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 522 transition count 510
Deduced a syphon composed of 135 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 522 transition count 510
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 238 place count 522 transition count 531
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 521 transition count 530
Deduced a syphon composed of 224 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 521 transition count 530
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 243 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 259 place count 521 transition count 643
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 279 place count 501 transition count 603
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 299 place count 501 transition count 603
Deduced a syphon composed of 223 places in 1 ms
Applied a total of 299 rules in 69 ms. Remains 501 /527 variables (removed 26) and now considering 603/497 (removed -106) transitions.
[2022-05-15 19:27:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 603 rows 501 cols
[2022-05-15 19:27:26] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-15 19:27:26] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/527 places, 603/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/527 places, 603/497 transitions.
Product exploration explored 100000 steps with 8990 reset in 374 ms.
Product exploration explored 100000 steps with 8960 reset in 351 ms.
Built C files in :
/tmp/ltsmin17545122655033261846
[2022-05-15 19:27:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17545122655033261846
Running compilation step : cd /tmp/ltsmin17545122655033261846;'/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 704 ms.
Running link step : cd /tmp/ltsmin17545122655033261846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17545122655033261846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9739698605509337459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 13 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:27:42] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-15 19:27:42] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:27:42] [INFO ] Computed 49 place invariants in 17 ms
[2022-05-15 19:27:43] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:27:43] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:27:44] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin5042558286947938852
[2022-05-15 19:27:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5042558286947938852
Running compilation step : cd /tmp/ltsmin5042558286947938852;'/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 768 ms.
Running link step : cd /tmp/ltsmin5042558286947938852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5042558286947938852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16940354646480514292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:27:59] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:27:59] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:27:59] [INFO ] Time to serialize gal into /tmp/LTL6489593336854161726.gal : 1 ms
[2022-05-15 19:27:59] [INFO ] Time to serialize properties into /tmp/LTL2441942540335410588.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/LTL6489593336854161726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2441942540335410588.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/LTL6489593...266
Read 1 LTL properties
Checking formula 0 : !(((!(X(X(!((!(G(F("(p444<=p431)"))))U(G("(p444<=p431)")))))))U("(p452>p409)")))
Formula 0 simplified : !(!XX!(!GF"(p444<=p431)" U G"(p444<=p431)") U "(p452>p409)")
Detected timeout of ITS tools.
[2022-05-15 19:28:14] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:28:14] [INFO ] Applying decomposition
[2022-05-15 19:28:14] [INFO ] Flatten gal took : 11 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/graph16958169404303699360.txt' '-o' '/tmp/graph16958169404303699360.bin' '-w' '/tmp/graph16958169404303699360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16958169404303699360.bin' '-l' '-1' '-v' '-w' '/tmp/graph16958169404303699360.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:28:14] [INFO ] Decomposing Gal with order
[2022-05-15 19:28:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:28:14] [INFO ] Removed a total of 132 redundant transitions.
[2022-05-15 19:28:14] [INFO ] Flatten gal took : 23 ms
[2022-05-15 19:28:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2022-05-15 19:28:14] [INFO ] Time to serialize gal into /tmp/LTL4307812355215037567.gal : 5 ms
[2022-05-15 19:28:14] [INFO ] Time to serialize properties into /tmp/LTL8483864339478117669.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/LTL4307812355215037567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8483864339478117669.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/LTL4307812...266
Read 1 LTL properties
Checking formula 0 : !(((!(X(X(!((!(G(F("(gu171.p444<=gu171.p431)"))))U(G("(gu171.p444<=gu171.p431)")))))))U("(gu175.p452>gu175.p409)")))
Formula 0 simplified : !(!XX!(!GF"(gu171.p444<=gu171.p431)" U G"(gu171.p444<=gu171.p431)") U "(gu175.p452>gu175.p409)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8606377578938328321
[2022-05-15 19:28:29] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8606377578938328321
Running compilation step : cd /tmp/ltsmin8606377578938328321;'/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 683 ms.
Running link step : cd /tmp/ltsmin8606377578938328321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8606377578938328321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X(X(!()) U []((LTLAPp0==true))))) U (LTLAPp1==true))' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLCardinality-13 finished in 227876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&X(X(G(p0)))))'
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:28:30] [INFO ] Computed 49 place invariants in 24 ms
[2022-05-15 19:28:30] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:28:30] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:28:32] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
// Phase 1: matrix 497 rows 527 cols
[2022-05-15 19:28:32] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:28:32] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 527/527 places, 497/497 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-14 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:(LEQ 1 s449)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-14 finished in 2237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X(G(G(p0))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(X(p1))))'
Found a SL insensitive property : DoubleExponent-PT-010-LTLCardinality-09
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 409 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 406 transition count 376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 239 place count 406 transition count 356
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 279 place count 386 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 295 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 277 transition count 265
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 277 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 276 transition count 264
Applied a total of 500 rules in 37 ms. Remains 276 /527 variables (removed 251) and now considering 264/497 (removed 233) transitions.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:28:33] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:28:33] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:28:33] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:28:33] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:28:33] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-15 19:28:33] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 276/527 places, 264/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/527 places, 264/497 transitions.
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s95 s157), p1:(LEQ s131 s154)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13889 reset in 103 ms.
Product exploration explored 100000 steps with 13891 reset in 125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 2921 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1399 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 794 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 293680 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293680 steps, saw 146890 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:28:40] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:28:40] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:28:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:28:40] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 19:28:40] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:28:41] [INFO ] After 170ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:28:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 470 ms
[2022-05-15 19:28:41] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 464 ms.
[2022-05-15 19:28:42] [INFO ] After 1551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 301 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 264/264 transitions.
Graph (complete) has 811 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 1 with 39 rules applied. Total rules applied 41 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 236 transition count 224
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 118 place count 236 transition count 224
Applied a total of 118 rules in 23 ms. Remains 236 /276 variables (removed 40) and now considering 224/264 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/276 places, 224/264 transitions.
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275803 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275803 steps, saw 137955 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:28:45] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:28:45] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:28:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:28:45] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 15 ms returned sat
[2022-05-15 19:28:46] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:28:46] [INFO ] After 153ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 382 ms
[2022-05-15 19:28:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-15 19:28:46] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-15 19:28:46] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 150 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:28:47] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:28:47] [INFO ] Implicit Places using invariants in 212 ms returned [20, 26, 46, 51, 100, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 213 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 220/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 217
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 213 transition count 217
Applied a total of 14 rules in 7 ms. Remains 213 /220 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:47] [INFO ] Computed 33 place invariants in 11 ms
[2022-05-15 19:28:47] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:47] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:28:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:28:48] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/236 places, 217/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/236 places, 217/224 transitions.
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 298321 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298321 steps, saw 149189 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:51] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:28:51] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:28:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 19:28:51] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:28:52] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:28:52] [INFO ] After 168ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-05-15 19:28:52] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:28:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:28:52] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:28:52] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:28:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 370 ms
[2022-05-15 19:28:52] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-15 19:28:52] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 132 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:52] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:28:53] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:53] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:28:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:28:54] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2022-05-15 19:28:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:28:54] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:28:54] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 213 transition count 199
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 195 transition count 199
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 187 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 187 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 186 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 186 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 184 transition count 188
Applied a total of 58 rules in 10 ms. Remains 184 /213 variables (removed 29) and now considering 188/217 (removed 29) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 184 cols
[2022-05-15 19:28:54] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 19:28:54] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:28:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 19:28:54] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 8 ms returned sat
[2022-05-15 19:28:54] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:28:54] [INFO ] After 59ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:54] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-15 19:28:54] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:28:54] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:28:54] [INFO ] Flatten gal took : 7 ms
[2022-05-15 19:28:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10950497259343682319.gal : 1 ms
[2022-05-15 19:28:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10516080789215378569.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17800846214895051139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10950497259343682319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10516080789215378569.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10516080789215378569.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 161
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :161 after 277
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :277 after 606
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :606 after 1385
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1385 after 3128
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3128 after 6634
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6634 after 13567
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :13567 after 27470
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :27470 after 55290
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :55290 after 110902
Detected timeout of ITS tools.
[2022-05-15 19:29:09] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:29:09] [INFO ] Applying decomposition
[2022-05-15 19:29:09] [INFO ] Flatten gal took : 7 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/graph2423278156251984241.txt' '-o' '/tmp/graph2423278156251984241.bin' '-w' '/tmp/graph2423278156251984241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2423278156251984241.bin' '-l' '-1' '-v' '-w' '/tmp/graph2423278156251984241.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:29:10] [INFO ] Decomposing Gal with order
[2022-05-15 19:29:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:29:10] [INFO ] Removed a total of 123 redundant transitions.
[2022-05-15 19:29:10] [INFO ] Flatten gal took : 14 ms
[2022-05-15 19:29:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2022-05-15 19:29:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11559169543283790.gal : 2 ms
[2022-05-15 19:29:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14318400497840890913.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17800846214895051139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11559169543283790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14318400497840890913.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality14318400497840890913.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :15 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 51
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :63 after 163
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :163 after 280
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :280 after 606
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :606 after 1455
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1455 after 3338
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3338 after 7124
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7124 after 14623
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :14623 after 29662
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :29662 after 59730
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :59730 after 119748
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15883196269511255919
[2022-05-15 19:29:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15883196269511255919
Running compilation step : cd /tmp/ltsmin15883196269511255919;'/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 506 ms.
Running link step : cd /tmp/ltsmin15883196269511255919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15883196269511255919;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:29:40] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-15 19:29:40] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:29:40] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:29:41] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:29:41] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:29:41] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 264/264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 851 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 800 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 323938 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323938 steps, saw 162020 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:29:45] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:29:45] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:29:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:29:45] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 19:29:45] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:29:45] [INFO ] After 168ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:45] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:29:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:29:45] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:29:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:29:45] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:29:46] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:29:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 416 ms
[2022-05-15 19:29:46] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 462 ms.
[2022-05-15 19:29:46] [INFO ] After 1496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 366 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 264/264 transitions.
Graph (complete) has 811 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 1 with 39 rules applied. Total rules applied 41 place count 275 transition count 224
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 236 transition count 224
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 118 place count 236 transition count 224
Applied a total of 118 rules in 25 ms. Remains 236 /276 variables (removed 40) and now considering 224/264 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/276 places, 224/264 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 328088 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328088 steps, saw 164142 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:29:50] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:29:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:29:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:29:50] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 15 ms returned sat
[2022-05-15 19:29:50] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:29:50] [INFO ] After 149ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:50] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:29:50] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:29:50] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:29:51] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:29:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:29:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 365 ms
[2022-05-15 19:29:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-15 19:29:51] [INFO ] After 709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-15 19:29:51] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 176 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 236 cols
[2022-05-15 19:29:51] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:29:51] [INFO ] Implicit Places using invariants in 197 ms returned [20, 26, 46, 51, 100, 106, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 197 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 220/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 220 transition count 217
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 213 transition count 217
Applied a total of 14 rules in 7 ms. Remains 213 /220 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:51] [INFO ] Computed 33 place invariants in 11 ms
[2022-05-15 19:29:51] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:51] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-15 19:29:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:29:52] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 213/236 places, 217/224 transitions.
Finished structural reductions, in 2 iterations. Remains : 213/236 places, 217/224 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 295468 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295468 steps, saw 147764 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:56] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:29:56] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:29:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-15 19:29:56] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-15 19:29:56] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:29:56] [INFO ] After 169ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:56] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:29:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:29:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:29:57] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:29:57] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:29:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 347 ms
[2022-05-15 19:29:57] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-15 19:29:57] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 112 ms.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 213/213 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:57] [INFO ] Computed 33 place invariants in 10 ms
[2022-05-15 19:29:57] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:57] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 19:29:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-15 19:29:58] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2022-05-15 19:29:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 217 rows 213 cols
[2022-05-15 19:29:58] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 19:29:58] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 217/217 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 213 transition count 199
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 195 transition count 199
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 187 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 187 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 186 transition count 190
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 186 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 184 transition count 188
Applied a total of 58 rules in 13 ms. Remains 184 /213 variables (removed 29) and now considering 188/217 (removed 29) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 184 cols
[2022-05-15 19:29:58] [INFO ] Computed 33 place invariants in 10 ms
[2022-05-15 19:29:58] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 19:29:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 19:29:58] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-15 19:29:58] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:29:58] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:59] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-15 19:29:59] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-15 19:29:59] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:29:59] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:29:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2489309446820433707.gal : 69 ms
[2022-05-15 19:29:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13807306342033077938.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2562005964096130196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2489309446820433707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13807306342033077938.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13807306342033077938.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 161
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :161 after 277
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :277 after 606
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :606 after 1385
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1385 after 3128
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3128 after 6634
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6634 after 13567
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :13567 after 27470
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :27470 after 55290
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :55290 after 110902
Detected timeout of ITS tools.
[2022-05-15 19:30:14] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:30:14] [INFO ] Applying decomposition
[2022-05-15 19:30:14] [INFO ] Flatten gal took : 8 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/graph10343971729589843451.txt' '-o' '/tmp/graph10343971729589843451.bin' '-w' '/tmp/graph10343971729589843451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10343971729589843451.bin' '-l' '-1' '-v' '-w' '/tmp/graph10343971729589843451.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:30:14] [INFO ] Decomposing Gal with order
[2022-05-15 19:30:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:30:14] [INFO ] Removed a total of 136 redundant transitions.
[2022-05-15 19:30:14] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:30:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 2 ms.
[2022-05-15 19:30:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17381100978273068795.gal : 38 ms
[2022-05-15 19:30:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2363784375268883353.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2562005964096130196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17381100978273068795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2363784375268883353.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2363784375268883353.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 52
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :52 after 86
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :86 after 163
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :163 after 316
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :316 after 616
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :616 after 1488
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1488 after 3402
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3402 after 7187
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7187 after 14668
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :14668 after 29675
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :29675 after 59724
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :59724 after 119703
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18306487215893115682
[2022-05-15 19:30:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18306487215893115682
Running compilation step : cd /tmp/ltsmin18306487215893115682;'/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 329 ms.
Running link step : cd /tmp/ltsmin18306487215893115682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18306487215893115682;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13934 reset in 128 ms.
Product exploration explored 100000 steps with 13919 reset in 126 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 264/264 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2022-05-15 19:30:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:30:45] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:30:45] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 264/264 transitions.
Product exploration explored 100000 steps with 13928 reset in 321 ms.
Product exploration explored 100000 steps with 13854 reset in 331 ms.
Built C files in :
/tmp/ltsmin15121280296977426845
[2022-05-15 19:30:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15121280296977426845
Running compilation step : cd /tmp/ltsmin15121280296977426845;'/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 413 ms.
Running link step : cd /tmp/ltsmin15121280296977426845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15121280296977426845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16392111977873525225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:31:01] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:31:01] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:31:01] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:31:02] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 276 cols
[2022-05-15 19:31:02] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:31:02] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 264/264 transitions.
Built C files in :
/tmp/ltsmin11442788497417252163
[2022-05-15 19:31:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11442788497417252163
Running compilation step : cd /tmp/ltsmin11442788497417252163;'/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 407 ms.
Running link step : cd /tmp/ltsmin11442788497417252163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11442788497417252163;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1432600411427959136.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:31:17] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:31:17] [INFO ] Flatten gal took : 7 ms
[2022-05-15 19:31:17] [INFO ] Time to serialize gal into /tmp/LTL4239190427598745453.gal : 1 ms
[2022-05-15 19:31:17] [INFO ] Time to serialize properties into /tmp/LTL17225398879212255478.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/LTL4239190427598745453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17225398879212255478.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/LTL4239190...267
Read 1 LTL properties
Checking formula 0 : !(((F("(p266>p366)"))||(G(X("(p324<=p362)")))))
Formula 0 simplified : !(F"(p266>p366)" | GX"(p324<=p362)")
Detected timeout of ITS tools.
[2022-05-15 19:31:32] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:31:32] [INFO ] Applying decomposition
[2022-05-15 19:31:32] [INFO ] Flatten gal took : 7 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/graph11970970692007567916.txt' '-o' '/tmp/graph11970970692007567916.bin' '-w' '/tmp/graph11970970692007567916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11970970692007567916.bin' '-l' '-1' '-v' '-w' '/tmp/graph11970970692007567916.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:31:32] [INFO ] Decomposing Gal with order
[2022-05-15 19:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:31:32] [INFO ] Removed a total of 237 redundant transitions.
[2022-05-15 19:31:32] [INFO ] Flatten gal took : 17 ms
[2022-05-15 19:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2022-05-15 19:31:32] [INFO ] Time to serialize gal into /tmp/LTL9787058614517942603.gal : 2 ms
[2022-05-15 19:31:32] [INFO ] Time to serialize properties into /tmp/LTL16493958680263757174.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/LTL9787058614517942603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16493958680263757174.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/LTL9787058...267
Read 1 LTL properties
Checking formula 0 : !(((F("(gu68.p266>gu68.p366)"))||(G(X("(gu67.p324<=gu67.p362)")))))
Formula 0 simplified : !(F"(gu68.p266>gu68.p366)" | GX"(gu67.p324<=gu67.p362)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7844086400705949077
[2022-05-15 19:31:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7844086400705949077
Running compilation step : cd /tmp/ltsmin7844086400705949077;'/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 401 ms.
Running link step : cd /tmp/ltsmin7844086400705949077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7844086400705949077;'/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))||[](X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 209565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X(p0))))))'
Found a SL insensitive property : DoubleExponent-PT-010-LTLCardinality-11
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 241 place count 405 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 467 place count 292 transition count 262
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 27 ms. Remains 273 /527 variables (removed 254) and now considering 261/497 (removed 236) transitions.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:32:02] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-15 19:32:02] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:32:02] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:32:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:32:03] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:32:04] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-15 19:32:04] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 273/527 places, 261/497 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/527 places, 261/497 transitions.
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s236 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13870 reset in 96 ms.
Product exploration explored 100000 steps with 13800 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 339571 states, properties seen :0
Probabilistic random walk after 679157 steps, saw 339571 distinct states, run finished after 2771 ms. (steps per millisecond=245 ) properties seen :0
Interrupted probabilistic random walk after 706107 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Exhaustive walk after 706107 steps, saw 353169 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:32:10] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:32:10] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:32:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 19:32:10] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 11 ms returned sat
[2022-05-15 19:32:10] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:32:10] [INFO ] After 173ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:10] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 19:32:10] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 112 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 813 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 14 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 715018 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 715018 steps, saw 357724 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:32:14] [INFO ] Computed 49 place invariants in 16 ms
[2022-05-15 19:32:14] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:32:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:32:14] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 19:32:14] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:32:14] [INFO ] After 85ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:32:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:32:15] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:32:15] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:32:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 738 ms
[2022-05-15 19:32:15] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-15 19:32:15] [INFO ] After 1070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:32:15] [INFO ] Computed 49 place invariants in 11 ms
[2022-05-15 19:32:15] [INFO ] Implicit Places using invariants in 287 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 298 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 15 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:15] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:32:16] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:16] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:32:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:32:17] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 830230 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 830230 steps, saw 415198 distinct states, run finished after 3006 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:20] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:32:20] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:32:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 26 ms returned sat
[2022-05-15 19:32:20] [INFO ] [Nat]Absence check using 9 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-15 19:32:20] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:32:20] [INFO ] After 116ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:20] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:32:20] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:20] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:32:21] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:21] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:32:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:32:22] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2022-05-15 19:32:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:32:22] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:32:22] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 11 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:32:22] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:32:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:32:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:32:22] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-15 19:32:22] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:32:22] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:22] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-05-15 19:32:22] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:32:22] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:32:22] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:32:22] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:32:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15479632589185137853.gal : 1 ms
[2022-05-15 19:32:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13425650668065459068.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5505261355591016783;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15479632589185137853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13425650668065459068.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13425650668065459068.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 182
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :182 after 284
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :284 after 1060
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1060 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 9547
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9547 after 20165
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :20165 after 45638
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :45638 after 98924
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :98924 after 212145
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :212145 after 441161
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :441161 after 906477
Detected timeout of ITS tools.
[2022-05-15 19:32:37] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:32:37] [INFO ] Applying decomposition
[2022-05-15 19:32:37] [INFO ] Flatten gal took : 8 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/graph7646326175154894541.txt' '-o' '/tmp/graph7646326175154894541.bin' '-w' '/tmp/graph7646326175154894541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7646326175154894541.bin' '-l' '-1' '-v' '-w' '/tmp/graph7646326175154894541.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:32:37] [INFO ] Decomposing Gal with order
[2022-05-15 19:32:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:32:37] [INFO ] Removed a total of 116 redundant transitions.
[2022-05-15 19:32:37] [INFO ] Flatten gal took : 14 ms
[2022-05-15 19:32:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2022-05-15 19:32:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4547486580035126332.gal : 1 ms
[2022-05-15 19:32:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16736917355943322346.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5505261355591016783;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4547486580035126332.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16736917355943322346.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16736917355943322346.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 199
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :199 after 454
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :454 after 2553
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2553 after 6656
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6656 after 17763
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :17763 after 53183
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :53183 after 135401
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :135401 after 376522
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :376522 after 1.01459e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.01459e+06 after 2.77488e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16586067568838778418
[2022-05-15 19:32:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16586067568838778418
Running compilation step : cd /tmp/ltsmin16586067568838778418;'/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 343 ms.
Running link step : cd /tmp/ltsmin16586067568838778418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16586067568838778418;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 1 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:33:08] [INFO ] Computed 49 place invariants in 11 ms
[2022-05-15 19:33:08] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:33:08] [INFO ] Computed 49 place invariants in 9 ms
[2022-05-15 19:33:08] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:33:09] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:33:09] [INFO ] Computed 49 place invariants in 12 ms
[2022-05-15 19:33:09] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 853 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 339571 states, properties seen :0
Probabilistic random walk after 679157 steps, saw 339571 distinct states, run finished after 2673 ms. (steps per millisecond=254 ) properties seen :0
Interrupted probabilistic random walk after 775627 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Exhaustive walk after 775627 steps, saw 387930 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:33:15] [INFO ] Computed 49 place invariants in 8 ms
[2022-05-15 19:33:15] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:33:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:33:15] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 10 ms returned sat
[2022-05-15 19:33:16] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:33:16] [INFO ] After 172ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:16] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-15 19:33:16] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 813 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 115 place count 235 transition count 223
Applied a total of 115 rules in 20 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/273 places, 223/261 transitions.
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 764234 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 764234 steps, saw 382352 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:33:19] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:33:19] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:33:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 19:33:19] [INFO ] [Nat]Absence check using 3 positive and 46 generalized place invariants in 12 ms returned sat
[2022-05-15 19:33:19] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:33:19] [INFO ] After 86ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:19] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2022-05-15 19:33:19] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:33:19] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:33:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 700 ms
[2022-05-15 19:33:20] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-15 19:33:20] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 235 cols
[2022-05-15 19:33:20] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:33:20] [INFO ] Implicit Places using invariants in 284 ms returned [20, 26, 47, 52, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 226, 232]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 298 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 217/235 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 217 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 208 transition count 214
Applied a total of 18 rules in 6 ms. Remains 208 /217 variables (removed 9) and now considering 214/223 (removed 9) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:20] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:33:21] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:21] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:33:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:33:22] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 208/235 places, 214/223 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/235 places, 214/223 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 834465 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 834465 steps, saw 417315 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:25] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-15 19:33:25] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:33:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-05-15 19:33:25] [INFO ] [Nat]Absence check using 9 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-15 19:33:25] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:33:25] [INFO ] After 115ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:25] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-15 19:33:25] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:26] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:33:26] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:26] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:33:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-15 19:33:27] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2022-05-15 19:33:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 208 cols
[2022-05-15 19:33:27] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 19:33:27] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 9 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2022-05-15 19:33:27] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:33:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:33:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 19:33:27] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-15 19:33:27] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 19:33:27] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:27] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-15 19:33:28] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 19:33:28] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:33:28] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:33:28] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:33:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16784064072238470852.gal : 1 ms
[2022-05-15 19:33:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14797317225862637723.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms6425530753508031088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16784064072238470852.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14797317225862637723.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14797317225862637723.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 182
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :182 after 284
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :284 after 1060
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1060 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 9547
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9547 after 20165
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :20165 after 45638
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :45638 after 98924
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :98924 after 212145
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :212145 after 441161
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :441161 after 906477
Detected timeout of ITS tools.
[2022-05-15 19:33:43] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:33:43] [INFO ] Applying decomposition
[2022-05-15 19:33:43] [INFO ] Flatten gal took : 8 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/graph8094486201795018125.txt' '-o' '/tmp/graph8094486201795018125.bin' '-w' '/tmp/graph8094486201795018125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8094486201795018125.bin' '-l' '-1' '-v' '-w' '/tmp/graph8094486201795018125.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:33:43] [INFO ] Decomposing Gal with order
[2022-05-15 19:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:33:43] [INFO ] Removed a total of 105 redundant transitions.
[2022-05-15 19:33:43] [INFO ] Flatten gal took : 68 ms
[2022-05-15 19:33:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2022-05-15 19:33:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4867513442813969881.gal : 1 ms
[2022-05-15 19:33:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5022461355025642513.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6425530753508031088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4867513442813969881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5022461355025642513.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5022461355025642513.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 389
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :389 after 1404
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1404 after 3588
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3588 after 14359
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14359 after 35657
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35657 after 93887
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93887 after 246752
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :246752 after 612692
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :612692 after 1.48385e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12414414902371787754
[2022-05-15 19:33:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12414414902371787754
Running compilation step : cd /tmp/ltsmin12414414902371787754;'/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 334 ms.
Running link step : cd /tmp/ltsmin12414414902371787754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12414414902371787754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13893 reset in 110 ms.
Product exploration explored 100000 steps with 13937 reset in 116 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2022-05-15 19:34:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:34:14] [INFO ] Computed 49 place invariants in 10 ms
[2022-05-15 19:34:14] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 261/261 transitions.
Product exploration explored 100000 steps with 13798 reset in 342 ms.
Product exploration explored 100000 steps with 13924 reset in 352 ms.
Built C files in :
/tmp/ltsmin16876385976301862221
[2022-05-15 19:34:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16876385976301862221
Running compilation step : cd /tmp/ltsmin16876385976301862221;'/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 392 ms.
Running link step : cd /tmp/ltsmin16876385976301862221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16876385976301862221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8631898349057900629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 2 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:34:30] [INFO ] Computed 49 place invariants in 13 ms
[2022-05-15 19:34:30] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:34:30] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-15 19:34:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 19:34:31] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
// Phase 1: matrix 261 rows 273 cols
[2022-05-15 19:34:31] [INFO ] Computed 49 place invariants in 14 ms
[2022-05-15 19:34:31] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin18115461699131469441
[2022-05-15 19:34:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18115461699131469441
Running compilation step : cd /tmp/ltsmin18115461699131469441;'/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 435 ms.
Running link step : cd /tmp/ltsmin18115461699131469441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18115461699131469441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2671359322946692253.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:34:46] [INFO ] Flatten gal took : 8 ms
[2022-05-15 19:34:46] [INFO ] Flatten gal took : 9 ms
[2022-05-15 19:34:46] [INFO ] Time to serialize gal into /tmp/LTL11202309671551784126.gal : 1 ms
[2022-05-15 19:34:46] [INFO ] Time to serialize properties into /tmp/LTL11830875793444730058.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/LTL11202309671551784126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11830875793444730058.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/LTL1120230...268
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(X("(p515<=p151)")))))))
Formula 0 simplified : !GXXGX"(p515<=p151)"
Detected timeout of ITS tools.
[2022-05-15 19:35:01] [INFO ] Flatten gal took : 10 ms
[2022-05-15 19:35:01] [INFO ] Applying decomposition
[2022-05-15 19:35:01] [INFO ] Flatten gal took : 13 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/graph14787369308340788813.txt' '-o' '/tmp/graph14787369308340788813.bin' '-w' '/tmp/graph14787369308340788813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14787369308340788813.bin' '-l' '-1' '-v' '-w' '/tmp/graph14787369308340788813.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:35:01] [INFO ] Decomposing Gal with order
[2022-05-15 19:35:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:35:01] [INFO ] Removed a total of 203 redundant transitions.
[2022-05-15 19:35:01] [INFO ] Flatten gal took : 16 ms
[2022-05-15 19:35:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2022-05-15 19:35:01] [INFO ] Time to serialize gal into /tmp/LTL1335967680741322271.gal : 2 ms
[2022-05-15 19:35:01] [INFO ] Time to serialize properties into /tmp/LTL10410910047761372614.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/LTL1335967680741322271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10410910047761372614.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/LTL1335967...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(X("(gu13.p515<=gu13.p151)")))))))
Formula 0 simplified : !GXXGX"(gu13.p515<=gu13.p151)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4514388316306275544
[2022-05-15 19:35:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4514388316306275544
Running compilation step : cd /tmp/ltsmin4514388316306275544;'/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 419 ms.
Running link step : cd /tmp/ltsmin4514388316306275544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4514388316306275544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X([](X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 209299 ms.
[2022-05-15 19:35:31] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11857713420607100227
[2022-05-15 19:35:31] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2022-05-15 19:35:31] [INFO ] Applying decomposition
[2022-05-15 19:35:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:35:31] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2022-05-15 19:35:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:35:31] [INFO ] Flatten gal took : 13 ms
[2022-05-15 19:35:31] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2022-05-15 19:35:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:35:31] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11857713420607100227
Running compilation step : cd /tmp/ltsmin11857713420607100227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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'
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/graph3134681533150384195.txt' '-o' '/tmp/graph3134681533150384195.bin' '-w' '/tmp/graph3134681533150384195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3134681533150384195.bin' '-l' '-1' '-v' '-w' '/tmp/graph3134681533150384195.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:35:31] [INFO ] Decomposing Gal with order
[2022-05-15 19:35:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:35:31] [INFO ] Removed a total of 142 redundant transitions.
[2022-05-15 19:35:31] [INFO ] Flatten gal took : 22 ms
[2022-05-15 19:35:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2022-05-15 19:35:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality5607884993056421060.gal : 4 ms
[2022-05-15 19:35:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality16347379963092322436.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/LTLCardinality5607884993056421060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16347379963092322436.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 4 LTL properties
Checking formula 0 : !((F(G(F("(gu43.p194<1)")))))
Formula 0 simplified : !FGF"(gu43.p194<1)"
Compilation finished in 1025 ms.
Running link step : cd /tmp/ltsmin11857713420607100227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11857713420607100227;'/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))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11857713420607100227;'/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))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11857713420607100227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X([]([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: LTL layer: formula: [](X([](<>(X([]([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.010: "[](X([](<>(X([]([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: There are 503 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.072: State length is 528, there are 501 groups
pins2lts-mc-linux64( 0/ 8), 0.072: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.072: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.072: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.072: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.096: [Blue] ~108 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 3/ 8), 0.120: [Blue] ~217 levels ~1920 states ~2136 transitions
pins2lts-mc-linux64( 0/ 8), 0.152: [Blue] ~237 levels ~3840 states ~4272 transitions
pins2lts-mc-linux64( 0/ 8), 0.220: [Blue] ~471 levels ~7680 states ~8560 transitions
pins2lts-mc-linux64( 2/ 8), 0.351: [Blue] ~1003 levels ~15360 states ~17168 transitions
pins2lts-mc-linux64( 0/ 8), 0.632: [Blue] ~1202 levels ~30720 states ~34448 transitions
pins2lts-mc-linux64( 0/ 8), 1.624: [Blue] ~1398 levels ~61440 states ~68824 transitions
pins2lts-mc-linux64( 2/ 8), 4.521: [Blue] ~1448 levels ~122880 states ~137232 transitions
pins2lts-mc-linux64( 2/ 8), 7.477: [Blue] ~1492 levels ~245760 states ~274064 transitions
pins2lts-mc-linux64( 2/ 8), 11.100: [Blue] ~2539 levels ~491520 states ~548280 transitions
pins2lts-mc-linux64( 2/ 8), 17.710: [Blue] ~4572 levels ~983040 states ~1096712 transitions
pins2lts-mc-linux64( 2/ 8), 30.546: [Blue] ~8699 levels ~1966080 states ~2192800 transitions
pins2lts-mc-linux64( 2/ 8), 55.748: [Blue] ~16830 levels ~3932160 states ~4385952 transitions
pins2lts-mc-linux64( 4/ 8), 105.290: [Blue] ~27883 levels ~7864320 states ~8741376 transitions
pins2lts-mc-linux64( 4/ 8), 204.798: [Blue] ~43924 levels ~15728640 states ~17459128 transitions
pins2lts-mc-linux64( 4/ 8), 404.399: [Blue] ~71988 levels ~31457280 states ~34896656 transitions
pins2lts-mc-linux64( 0/ 8), 807.318: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 807.358:
pins2lts-mc-linux64( 0/ 8), 807.359: Explored 61539449 states 68399142 transitions, fanout: 1.111
pins2lts-mc-linux64( 0/ 8), 807.359: Total exploration time 807.270 sec (807.220 sec minimum, 807.245 sec on average)
pins2lts-mc-linux64( 0/ 8), 807.359: States per second: 76232, Transitions per second: 84729
pins2lts-mc-linux64( 0/ 8), 807.359:
pins2lts-mc-linux64( 0/ 8), 807.359: State space has 48493933 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 807.359: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 807.359: blue states: 61539449 (126.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 807.359: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 807.359: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 807.359:
pins2lts-mc-linux64( 0/ 8), 807.359: Total memory used for local state coloring: 5.8MB
pins2lts-mc-linux64( 0/ 8), 807.359:
pins2lts-mc-linux64( 0/ 8), 807.359: Queue width: 8B, total height: 382568, memory: 2.92MB
pins2lts-mc-linux64( 0/ 8), 807.359: Tree memory: 626.0MB, 13.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 807.359: Tree fill ratio (roots/leafs): 36.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 807.359: Stored 499 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 807.359: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 807.359: Est. total memory use: 628.9MB (~1026.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11857713420607100227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X([]([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11857713420607100227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X([]([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 20:04:29] [INFO ] Flatten gal took : 14 ms
[2022-05-15 20:04:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality17714626337688353236.gal : 2 ms
[2022-05-15 20:04:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality1018479929964844082.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/LTLCardinality17714626337688353236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1018479929964844082.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 4 LTL properties
Checking formula 0 : !((F(G(F("(p194<1)")))))
Formula 0 simplified : !FGF"(p194<1)"

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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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-165260110000195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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