Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716796273354

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 07:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 07:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:51:15] [INFO ] Load time of PNML (sax parser for PT used): 479 ms
[2024-05-27 07:51:16] [INFO ] Transformed 1992 places.
[2024-05-27 07:51:16] [INFO ] Transformed 3096 transitions.
[2024-05-27 07:51:16] [INFO ] Found NUPN structural information;
[2024-05-27 07:51:16] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 676 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 91 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1530 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 159 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:51:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-27 07:51:17] [INFO ] Computed 31 invariants in 74 ms
[2024-05-27 07:51:18] [INFO ] Implicit Places using invariants in 1240 ms returned [1976, 1977, 1978, 1980, 1989, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1312 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 51 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1562 ms. Remains : 1985/1992 places, 3096/3096 transitions.
Support contains 1530 out of 1985 places after structural reductions.
[2024-05-27 07:51:19] [INFO ] Flatten gal took : 444 ms
[2024-05-27 07:51:20] [INFO ] Flatten gal took : 226 ms
[2024-05-27 07:51:20] [INFO ] Input system was already deterministic with 3096 transitions.
Reduction of identical properties reduced properties to check from 30 to 26
RANDOM walk for 40000 steps (8 resets) in 4420 ms. (9 steps per ms) remains 9/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2322 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
[2024-05-27 07:51:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-05-27 07:51:23] [INFO ] Computed 24 invariants in 41 ms
[2024-05-27 07:51:23] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1804/1976 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1976 variables, 1804/1991 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-27 07:51:28] [INFO ] Deduced a trap composed of 42 places in 2335 ms of which 159 ms to minimize.
[2024-05-27 07:51:30] [INFO ] Deduced a trap composed of 28 places in 1697 ms of which 17 ms to minimize.
SMT process timed out in 6485ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 172 out of 1985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 877 transitions
Trivial Post-agglo rules discarded 877 transitions
Performed 877 trivial Post agglomeration. Transition count delta: 877
Iterating post reduction 0 with 877 rules applied. Total rules applied 877 place count 1985 transition count 2219
Reduce places removed 877 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 881 rules applied. Total rules applied 1758 place count 1108 transition count 2215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1762 place count 1104 transition count 2215
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 403 Pre rules applied. Total rules applied 1762 place count 1104 transition count 1812
Deduced a syphon composed of 403 places in 1 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 3 with 806 rules applied. Total rules applied 2568 place count 701 transition count 1812
Applied a total of 2568 rules in 369 ms. Remains 701 /1985 variables (removed 1284) and now considering 1812/3096 (removed 1284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 701/1985 places, 1812/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1061 ms. (37 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2286 ms. (17 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
[2024-05-27 07:51:31] [INFO ] Flow matrix only has 1476 transitions (discarded 336 similar events)
// Phase 1: matrix 1476 rows 701 cols
[2024-05-27 07:51:31] [INFO ] Computed 24 invariants in 7 ms
[2024-05-27 07:51:31] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 521/692 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 521/707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:33] [INFO ] Deduced a trap composed of 35 places in 726 ms of which 9 ms to minimize.
[2024-05-27 07:51:34] [INFO ] Deduced a trap composed of 11 places in 667 ms of which 7 ms to minimize.
[2024-05-27 07:51:34] [INFO ] Deduced a trap composed of 14 places in 589 ms of which 6 ms to minimize.
[2024-05-27 07:51:35] [INFO ] Deduced a trap composed of 13 places in 691 ms of which 10 ms to minimize.
[2024-05-27 07:51:36] [INFO ] Deduced a trap composed of 39 places in 668 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 5/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:37] [INFO ] Deduced a trap composed of 24 places in 778 ms of which 9 ms to minimize.
[2024-05-27 07:51:38] [INFO ] Deduced a trap composed of 40 places in 802 ms of which 10 ms to minimize.
[2024-05-27 07:51:39] [INFO ] Deduced a trap composed of 46 places in 842 ms of which 10 ms to minimize.
[2024-05-27 07:51:40] [INFO ] Deduced a trap composed of 57 places in 1024 ms of which 9 ms to minimize.
[2024-05-27 07:51:40] [INFO ] Deduced a trap composed of 13 places in 801 ms of which 10 ms to minimize.
[2024-05-27 07:51:41] [INFO ] Deduced a trap composed of 30 places in 681 ms of which 7 ms to minimize.
[2024-05-27 07:51:42] [INFO ] Deduced a trap composed of 61 places in 841 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 7/719 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:43] [INFO ] Deduced a trap composed of 49 places in 811 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:44] [INFO ] Deduced a trap composed of 78 places in 839 ms of which 10 ms to minimize.
[2024-05-27 07:51:45] [INFO ] Deduced a trap composed of 44 places in 800 ms of which 8 ms to minimize.
[2024-05-27 07:51:46] [INFO ] Deduced a trap composed of 13 places in 747 ms of which 10 ms to minimize.
[2024-05-27 07:51:47] [INFO ] Deduced a trap composed of 100 places in 729 ms of which 9 ms to minimize.
[2024-05-27 07:51:48] [INFO ] Deduced a trap composed of 16 places in 843 ms of which 9 ms to minimize.
[2024-05-27 07:51:49] [INFO ] Deduced a trap composed of 33 places in 835 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 6/726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:50] [INFO ] Deduced a trap composed of 28 places in 861 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/692 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:51:51] [INFO ] Deduced a trap composed of 60 places in 886 ms of which 10 ms to minimize.
[2024-05-27 07:51:52] [INFO ] Deduced a trap composed of 59 places in 880 ms of which 10 ms to minimize.
[2024-05-27 07:51:53] [INFO ] Deduced a trap composed of 61 places in 780 ms of which 9 ms to minimize.
[2024-05-27 07:51:54] [INFO ] Deduced a trap composed of 11 places in 851 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/692 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 8/700 variables, 8/739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 8/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/701 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/701 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/701 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1476/2177 variables, 701/1450 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2177 variables, 497/1947 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2177 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/2177 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2177 variables, and 1947 constraints, problems are : Problem set: 0 solved, 8 unsolved in 26410 ms.
Refiners :[Domain max(s): 701/701 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 701/701 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 521/692 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 521/707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 24/731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:00] [INFO ] Deduced a trap composed of 51 places in 713 ms of which 9 ms to minimize.
[2024-05-27 07:52:01] [INFO ] Deduced a trap composed of 11 places in 831 ms of which 10 ms to minimize.
[2024-05-27 07:52:01] [INFO ] Deduced a trap composed of 36 places in 796 ms of which 10 ms to minimize.
[2024-05-27 07:52:02] [INFO ] Deduced a trap composed of 52 places in 772 ms of which 10 ms to minimize.
[2024-05-27 07:52:03] [INFO ] Deduced a trap composed of 38 places in 726 ms of which 9 ms to minimize.
[2024-05-27 07:52:04] [INFO ] Deduced a trap composed of 81 places in 736 ms of which 9 ms to minimize.
[2024-05-27 07:52:04] [INFO ] Deduced a trap composed of 36 places in 604 ms of which 9 ms to minimize.
[2024-05-27 07:52:05] [INFO ] Deduced a trap composed of 60 places in 709 ms of which 10 ms to minimize.
[2024-05-27 07:52:06] [INFO ] Deduced a trap composed of 34 places in 695 ms of which 11 ms to minimize.
[2024-05-27 07:52:07] [INFO ] Deduced a trap composed of 39 places in 773 ms of which 9 ms to minimize.
[2024-05-27 07:52:07] [INFO ] Deduced a trap composed of 40 places in 793 ms of which 8 ms to minimize.
[2024-05-27 07:52:08] [INFO ] Deduced a trap composed of 50 places in 647 ms of which 6 ms to minimize.
[2024-05-27 07:52:09] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 6 ms to minimize.
[2024-05-27 07:52:09] [INFO ] Deduced a trap composed of 73 places in 406 ms of which 7 ms to minimize.
[2024-05-27 07:52:09] [INFO ] Deduced a trap composed of 72 places in 402 ms of which 6 ms to minimize.
[2024-05-27 07:52:10] [INFO ] Deduced a trap composed of 83 places in 464 ms of which 7 ms to minimize.
[2024-05-27 07:52:10] [INFO ] Deduced a trap composed of 83 places in 479 ms of which 6 ms to minimize.
[2024-05-27 07:52:11] [INFO ] Deduced a trap composed of 46 places in 639 ms of which 7 ms to minimize.
[2024-05-27 07:52:12] [INFO ] Deduced a trap composed of 46 places in 655 ms of which 5 ms to minimize.
[2024-05-27 07:52:12] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 20/751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:13] [INFO ] Deduced a trap composed of 22 places in 517 ms of which 6 ms to minimize.
[2024-05-27 07:52:14] [INFO ] Deduced a trap composed of 46 places in 598 ms of which 8 ms to minimize.
[2024-05-27 07:52:14] [INFO ] Deduced a trap composed of 56 places in 525 ms of which 7 ms to minimize.
[2024-05-27 07:52:15] [INFO ] Deduced a trap composed of 61 places in 531 ms of which 6 ms to minimize.
[2024-05-27 07:52:15] [INFO ] Deduced a trap composed of 86 places in 382 ms of which 6 ms to minimize.
[2024-05-27 07:52:15] [INFO ] Deduced a trap composed of 63 places in 368 ms of which 5 ms to minimize.
[2024-05-27 07:52:16] [INFO ] Deduced a trap composed of 63 places in 411 ms of which 5 ms to minimize.
[2024-05-27 07:52:16] [INFO ] Deduced a trap composed of 75 places in 324 ms of which 3 ms to minimize.
[2024-05-27 07:52:17] [INFO ] Deduced a trap composed of 89 places in 370 ms of which 6 ms to minimize.
[2024-05-27 07:52:17] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 4 ms to minimize.
[2024-05-27 07:52:17] [INFO ] Deduced a trap composed of 46 places in 365 ms of which 6 ms to minimize.
[2024-05-27 07:52:18] [INFO ] Deduced a trap composed of 50 places in 380 ms of which 6 ms to minimize.
[2024-05-27 07:52:18] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 5 ms to minimize.
[2024-05-27 07:52:19] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 5 ms to minimize.
[2024-05-27 07:52:19] [INFO ] Deduced a trap composed of 27 places in 629 ms of which 9 ms to minimize.
[2024-05-27 07:52:20] [INFO ] Deduced a trap composed of 25 places in 494 ms of which 8 ms to minimize.
[2024-05-27 07:52:21] [INFO ] Deduced a trap composed of 24 places in 630 ms of which 8 ms to minimize.
[2024-05-27 07:52:21] [INFO ] Deduced a trap composed of 26 places in 448 ms of which 5 ms to minimize.
[2024-05-27 07:52:22] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 6 ms to minimize.
[2024-05-27 07:52:22] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 20/771 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:23] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 5 ms to minimize.
[2024-05-27 07:52:23] [INFO ] Deduced a trap composed of 57 places in 326 ms of which 4 ms to minimize.
[2024-05-27 07:52:23] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 4 ms to minimize.
[2024-05-27 07:52:24] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 5 ms to minimize.
[2024-05-27 07:52:25] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 4 ms to minimize.
[2024-05-27 07:52:25] [INFO ] Deduced a trap composed of 14 places in 392 ms of which 6 ms to minimize.
[2024-05-27 07:52:25] [INFO ] Deduced a trap composed of 16 places in 393 ms of which 5 ms to minimize.
[2024-05-27 07:52:26] [INFO ] Deduced a trap composed of 40 places in 718 ms of which 10 ms to minimize.
[2024-05-27 07:52:27] [INFO ] Deduced a trap composed of 59 places in 737 ms of which 8 ms to minimize.
[2024-05-27 07:52:28] [INFO ] Deduced a trap composed of 53 places in 561 ms of which 6 ms to minimize.
[2024-05-27 07:52:28] [INFO ] Deduced a trap composed of 50 places in 580 ms of which 5 ms to minimize.
[2024-05-27 07:52:29] [INFO ] Deduced a trap composed of 116 places in 460 ms of which 5 ms to minimize.
[2024-05-27 07:52:29] [INFO ] Deduced a trap composed of 72 places in 477 ms of which 5 ms to minimize.
[2024-05-27 07:52:30] [INFO ] Deduced a trap composed of 83 places in 434 ms of which 5 ms to minimize.
[2024-05-27 07:52:30] [INFO ] Deduced a trap composed of 41 places in 810 ms of which 9 ms to minimize.
[2024-05-27 07:52:31] [INFO ] Deduced a trap composed of 89 places in 435 ms of which 5 ms to minimize.
[2024-05-27 07:52:31] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 8 ms to minimize.
[2024-05-27 07:52:32] [INFO ] Deduced a trap composed of 41 places in 725 ms of which 6 ms to minimize.
[2024-05-27 07:52:33] [INFO ] Deduced a trap composed of 44 places in 593 ms of which 6 ms to minimize.
[2024-05-27 07:52:34] [INFO ] Deduced a trap composed of 43 places in 593 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 20/791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:35] [INFO ] Deduced a trap composed of 14 places in 764 ms of which 9 ms to minimize.
[2024-05-27 07:52:35] [INFO ] Deduced a trap composed of 23 places in 650 ms of which 9 ms to minimize.
[2024-05-27 07:52:36] [INFO ] Deduced a trap composed of 35 places in 550 ms of which 6 ms to minimize.
[2024-05-27 07:52:37] [INFO ] Deduced a trap composed of 24 places in 659 ms of which 9 ms to minimize.
[2024-05-27 07:52:37] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 5 ms to minimize.
[2024-05-27 07:52:38] [INFO ] Deduced a trap composed of 35 places in 610 ms of which 8 ms to minimize.
[2024-05-27 07:52:38] [INFO ] Deduced a trap composed of 25 places in 576 ms of which 9 ms to minimize.
[2024-05-27 07:52:39] [INFO ] Deduced a trap composed of 48 places in 722 ms of which 9 ms to minimize.
[2024-05-27 07:52:40] [INFO ] Deduced a trap composed of 93 places in 644 ms of which 8 ms to minimize.
[2024-05-27 07:52:41] [INFO ] Deduced a trap composed of 15 places in 705 ms of which 10 ms to minimize.
[2024-05-27 07:52:41] [INFO ] Deduced a trap composed of 80 places in 518 ms of which 6 ms to minimize.
[2024-05-27 07:52:42] [INFO ] Deduced a trap composed of 28 places in 667 ms of which 8 ms to minimize.
[2024-05-27 07:52:42] [INFO ] Deduced a trap composed of 79 places in 591 ms of which 8 ms to minimize.
[2024-05-27 07:52:43] [INFO ] Deduced a trap composed of 63 places in 683 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 692/2177 variables, and 805 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45011 ms.
Refiners :[Domain max(s): 692/701 constraints, Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/701 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 98/98 constraints]
After SMT, in 71853ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1812/1812 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 701 transition count 1811
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 700 transition count 1811
Applied a total of 2 rules in 103 ms. Remains 700 /701 variables (removed 1) and now considering 1811/1812 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 700/701 places, 1811/1812 transitions.
RANDOM walk for 40000 steps (8 resets) in 690 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1794 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 230238 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 8
Probabilistic random walk after 230238 steps, saw 51709 distinct states, run finished after 3011 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-27 07:52:47] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
// Phase 1: matrix 1475 rows 700 cols
[2024-05-27 07:52:47] [INFO ] Computed 24 invariants in 5 ms
[2024-05-27 07:52:47] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 520/691 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 520/706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:49] [INFO ] Deduced a trap composed of 72 places in 542 ms of which 6 ms to minimize.
[2024-05-27 07:52:49] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 6 ms to minimize.
[2024-05-27 07:52:50] [INFO ] Deduced a trap composed of 37 places in 482 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:52:51] [INFO ] Deduced a trap composed of 16 places in 655 ms of which 6 ms to minimize.
[2024-05-27 07:52:51] [INFO ] Deduced a trap composed of 11 places in 533 ms of which 6 ms to minimize.
[2024-05-27 07:52:52] [INFO ] Deduced a trap composed of 13 places in 708 ms of which 9 ms to minimize.
[2024-05-27 07:52:53] [INFO ] Deduced a trap composed of 26 places in 623 ms of which 5 ms to minimize.
[2024-05-27 07:52:53] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 5 ms to minimize.
[2024-05-27 07:52:54] [INFO ] Deduced a trap composed of 47 places in 434 ms of which 6 ms to minimize.
[2024-05-27 07:52:54] [INFO ] Deduced a trap composed of 65 places in 609 ms of which 5 ms to minimize.
[2024-05-27 07:52:55] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 9 ms to minimize.
[2024-05-27 07:52:56] [INFO ] Deduced a trap composed of 76 places in 695 ms of which 9 ms to minimize.
[2024-05-27 07:52:56] [INFO ] Deduced a trap composed of 53 places in 849 ms of which 9 ms to minimize.
[2024-05-27 07:52:57] [INFO ] Deduced a trap composed of 44 places in 834 ms of which 10 ms to minimize.
[2024-05-27 07:52:58] [INFO ] Deduced a trap composed of 11 places in 677 ms of which 6 ms to minimize.
[2024-05-27 07:52:59] [INFO ] Deduced a trap composed of 64 places in 719 ms of which 5 ms to minimize.
[2024-05-27 07:52:59] [INFO ] Deduced a trap composed of 39 places in 533 ms of which 6 ms to minimize.
[2024-05-27 07:53:00] [INFO ] Deduced a trap composed of 15 places in 499 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 15/724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:01] [INFO ] Deduced a trap composed of 44 places in 444 ms of which 6 ms to minimize.
[2024-05-27 07:53:01] [INFO ] Deduced a trap composed of 14 places in 552 ms of which 8 ms to minimize.
[2024-05-27 07:53:02] [INFO ] Deduced a trap composed of 23 places in 672 ms of which 8 ms to minimize.
[2024-05-27 07:53:02] [INFO ] Deduced a trap composed of 62 places in 677 ms of which 9 ms to minimize.
[2024-05-27 07:53:03] [INFO ] Deduced a trap composed of 31 places in 783 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 5/729 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 8/699 variables, 8/737 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:05] [INFO ] Deduced a trap composed of 44 places in 648 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/700 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:06] [INFO ] Deduced a trap composed of 46 places in 698 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/700 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1475/2175 variables, 700/1449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2175 variables, 497/1946 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2175 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/2175 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2175/2175 variables, and 1946 constraints, problems are : Problem set: 0 solved, 8 unsolved in 21411 ms.
Refiners :[Domain max(s): 700/700 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 700/700 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 520/691 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 520/706 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 24/730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:11] [INFO ] Deduced a trap composed of 14 places in 771 ms of which 10 ms to minimize.
[2024-05-27 07:53:11] [INFO ] Deduced a trap composed of 40 places in 702 ms of which 6 ms to minimize.
[2024-05-27 07:53:12] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 9 ms to minimize.
[2024-05-27 07:53:12] [INFO ] Deduced a trap composed of 16 places in 549 ms of which 6 ms to minimize.
[2024-05-27 07:53:13] [INFO ] Deduced a trap composed of 28 places in 676 ms of which 7 ms to minimize.
[2024-05-27 07:53:14] [INFO ] Deduced a trap composed of 94 places in 701 ms of which 6 ms to minimize.
[2024-05-27 07:53:14] [INFO ] Deduced a trap composed of 74 places in 567 ms of which 6 ms to minimize.
[2024-05-27 07:53:15] [INFO ] Deduced a trap composed of 24 places in 627 ms of which 9 ms to minimize.
[2024-05-27 07:53:16] [INFO ] Deduced a trap composed of 39 places in 631 ms of which 6 ms to minimize.
[2024-05-27 07:53:16] [INFO ] Deduced a trap composed of 61 places in 517 ms of which 6 ms to minimize.
[2024-05-27 07:53:17] [INFO ] Deduced a trap composed of 22 places in 580 ms of which 6 ms to minimize.
[2024-05-27 07:53:17] [INFO ] Deduced a trap composed of 33 places in 549 ms of which 6 ms to minimize.
[2024-05-27 07:53:18] [INFO ] Deduced a trap composed of 39 places in 583 ms of which 6 ms to minimize.
[2024-05-27 07:53:19] [INFO ] Deduced a trap composed of 14 places in 677 ms of which 6 ms to minimize.
[2024-05-27 07:53:19] [INFO ] Deduced a trap composed of 50 places in 654 ms of which 9 ms to minimize.
[2024-05-27 07:53:20] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 5 ms to minimize.
[2024-05-27 07:53:21] [INFO ] Deduced a trap composed of 72 places in 636 ms of which 9 ms to minimize.
[2024-05-27 07:53:21] [INFO ] Deduced a trap composed of 53 places in 587 ms of which 7 ms to minimize.
[2024-05-27 07:53:22] [INFO ] Deduced a trap composed of 50 places in 407 ms of which 5 ms to minimize.
[2024-05-27 07:53:22] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:23] [INFO ] Deduced a trap composed of 102 places in 700 ms of which 8 ms to minimize.
[2024-05-27 07:53:24] [INFO ] Deduced a trap composed of 50 places in 749 ms of which 9 ms to minimize.
[2024-05-27 07:53:25] [INFO ] Deduced a trap composed of 72 places in 641 ms of which 9 ms to minimize.
[2024-05-27 07:53:25] [INFO ] Deduced a trap composed of 60 places in 606 ms of which 5 ms to minimize.
[2024-05-27 07:53:26] [INFO ] Deduced a trap composed of 83 places in 489 ms of which 5 ms to minimize.
[2024-05-27 07:53:26] [INFO ] Deduced a trap composed of 91 places in 377 ms of which 4 ms to minimize.
[2024-05-27 07:53:27] [INFO ] Deduced a trap composed of 72 places in 383 ms of which 5 ms to minimize.
[2024-05-27 07:53:27] [INFO ] Deduced a trap composed of 83 places in 592 ms of which 8 ms to minimize.
[2024-05-27 07:53:28] [INFO ] Deduced a trap composed of 83 places in 410 ms of which 5 ms to minimize.
[2024-05-27 07:53:28] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 5 ms to minimize.
[2024-05-27 07:53:28] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 3 ms to minimize.
[2024-05-27 07:53:29] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 4 ms to minimize.
[2024-05-27 07:53:29] [INFO ] Deduced a trap composed of 61 places in 372 ms of which 6 ms to minimize.
[2024-05-27 07:53:30] [INFO ] Deduced a trap composed of 89 places in 738 ms of which 12 ms to minimize.
[2024-05-27 07:53:31] [INFO ] Deduced a trap composed of 65 places in 714 ms of which 9 ms to minimize.
[2024-05-27 07:53:31] [INFO ] Deduced a trap composed of 41 places in 565 ms of which 8 ms to minimize.
[2024-05-27 07:53:32] [INFO ] Deduced a trap composed of 15 places in 770 ms of which 10 ms to minimize.
[2024-05-27 07:53:33] [INFO ] Deduced a trap composed of 17 places in 856 ms of which 11 ms to minimize.
[2024-05-27 07:53:34] [INFO ] Deduced a trap composed of 25 places in 849 ms of which 10 ms to minimize.
[2024-05-27 07:53:35] [INFO ] Deduced a trap composed of 13 places in 851 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 20/770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:36] [INFO ] Deduced a trap composed of 11 places in 876 ms of which 10 ms to minimize.
[2024-05-27 07:53:36] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 5 ms to minimize.
[2024-05-27 07:53:37] [INFO ] Deduced a trap composed of 50 places in 352 ms of which 5 ms to minimize.
[2024-05-27 07:53:38] [INFO ] Deduced a trap composed of 31 places in 766 ms of which 9 ms to minimize.
[2024-05-27 07:53:39] [INFO ] Deduced a trap composed of 49 places in 721 ms of which 9 ms to minimize.
[2024-05-27 07:53:39] [INFO ] Deduced a trap composed of 48 places in 740 ms of which 9 ms to minimize.
[2024-05-27 07:53:40] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 7/777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 8/699 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 8/793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:43] [INFO ] Deduced a trap composed of 38 places in 815 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/700 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/700 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:45] [INFO ] Deduced a trap composed of 50 places in 749 ms of which 8 ms to minimize.
[2024-05-27 07:53:45] [INFO ] Deduced a trap composed of 80 places in 677 ms of which 9 ms to minimize.
[2024-05-27 07:53:46] [INFO ] Deduced a trap composed of 24 places in 801 ms of which 8 ms to minimize.
[2024-05-27 07:53:47] [INFO ] Deduced a trap composed of 27 places in 725 ms of which 8 ms to minimize.
[2024-05-27 07:53:48] [INFO ] Deduced a trap composed of 76 places in 733 ms of which 9 ms to minimize.
[2024-05-27 07:53:49] [INFO ] Deduced a trap composed of 34 places in 697 ms of which 8 ms to minimize.
[2024-05-27 07:53:50] [INFO ] Deduced a trap composed of 66 places in 700 ms of which 8 ms to minimize.
[2024-05-27 07:53:50] [INFO ] Deduced a trap composed of 35 places in 700 ms of which 9 ms to minimize.
[2024-05-27 07:53:51] [INFO ] Deduced a trap composed of 50 places in 481 ms of which 6 ms to minimize.
[2024-05-27 07:53:52] [INFO ] Deduced a trap composed of 13 places in 838 ms of which 10 ms to minimize.
[2024-05-27 07:53:52] [INFO ] Deduced a trap composed of 72 places in 420 ms of which 5 ms to minimize.
[2024-05-27 07:53:53] [INFO ] Deduced a trap composed of 11 places in 686 ms of which 9 ms to minimize.
[2024-05-27 07:53:54] [INFO ] Deduced a trap composed of 55 places in 574 ms of which 7 ms to minimize.
[2024-05-27 07:53:54] [INFO ] Deduced a trap composed of 55 places in 551 ms of which 7 ms to minimize.
[2024-05-27 07:53:55] [INFO ] Deduced a trap composed of 55 places in 615 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/700 variables, 15/812 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:53:56] [INFO ] Deduced a trap composed of 11 places in 591 ms of which 7 ms to minimize.
[2024-05-27 07:53:57] [INFO ] Deduced a trap composed of 24 places in 707 ms of which 6 ms to minimize.
[2024-05-27 07:53:57] [INFO ] Deduced a trap composed of 52 places in 523 ms of which 6 ms to minimize.
[2024-05-27 07:53:58] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 4 ms to minimize.
[2024-05-27 07:53:59] [INFO ] Deduced a trap composed of 24 places in 776 ms of which 9 ms to minimize.
[2024-05-27 07:53:59] [INFO ] Deduced a trap composed of 48 places in 425 ms of which 8 ms to minimize.
[2024-05-27 07:54:00] [INFO ] Deduced a trap composed of 23 places in 684 ms of which 8 ms to minimize.
[2024-05-27 07:54:01] [INFO ] Deduced a trap composed of 45 places in 716 ms of which 9 ms to minimize.
[2024-05-27 07:54:01] [INFO ] Deduced a trap composed of 35 places in 647 ms of which 8 ms to minimize.
[2024-05-27 07:54:02] [INFO ] Deduced a trap composed of 34 places in 521 ms of which 10 ms to minimize.
[2024-05-27 07:54:03] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 5 ms to minimize.
[2024-05-27 07:54:03] [INFO ] Deduced a trap composed of 33 places in 606 ms of which 8 ms to minimize.
[2024-05-27 07:54:04] [INFO ] Deduced a trap composed of 24 places in 560 ms of which 5 ms to minimize.
[2024-05-27 07:54:05] [INFO ] Deduced a trap composed of 33 places in 415 ms of which 6 ms to minimize.
[2024-05-27 07:54:05] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 5 ms to minimize.
[2024-05-27 07:54:06] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 7 ms to minimize.
[2024-05-27 07:54:06] [INFO ] Deduced a trap composed of 83 places in 602 ms of which 8 ms to minimize.
[2024-05-27 07:54:07] [INFO ] Deduced a trap composed of 83 places in 584 ms of which 8 ms to minimize.
[2024-05-27 07:54:08] [INFO ] Deduced a trap composed of 25 places in 586 ms of which 5 ms to minimize.
[2024-05-27 07:54:08] [INFO ] Deduced a trap composed of 31 places in 432 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 20/832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:54:10] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 7 ms to minimize.
[2024-05-27 07:54:10] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 7 ms to minimize.
[2024-05-27 07:54:11] [INFO ] Deduced a trap composed of 13 places in 813 ms of which 9 ms to minimize.
[2024-05-27 07:54:12] [INFO ] Deduced a trap composed of 15 places in 860 ms of which 10 ms to minimize.
[2024-05-27 07:54:13] [INFO ] Deduced a trap composed of 17 places in 810 ms of which 9 ms to minimize.
[2024-05-27 07:54:14] [INFO ] Deduced a trap composed of 16 places in 810 ms of which 9 ms to minimize.
[2024-05-27 07:54:15] [INFO ] Deduced a trap composed of 78 places in 726 ms of which 8 ms to minimize.
[2024-05-27 07:54:15] [INFO ] Deduced a trap composed of 39 places in 713 ms of which 9 ms to minimize.
[2024-05-27 07:54:16] [INFO ] Deduced a trap composed of 31 places in 738 ms of which 8 ms to minimize.
[2024-05-27 07:54:17] [INFO ] Deduced a trap composed of 51 places in 718 ms of which 8 ms to minimize.
[2024-05-27 07:54:18] [INFO ] Deduced a trap composed of 33 places in 741 ms of which 8 ms to minimize.
[2024-05-27 07:54:19] [INFO ] Deduced a trap composed of 55 places in 445 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/700 variables, 12/844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-27 07:54:20] [INFO ] Deduced a trap composed of 46 places in 657 ms of which 6 ms to minimize.
[2024-05-27 07:54:21] [INFO ] Deduced a trap composed of 59 places in 624 ms of which 9 ms to minimize.
[2024-05-27 07:54:22] [INFO ] Deduced a trap composed of 79 places in 649 ms of which 9 ms to minimize.
[2024-05-27 07:54:22] [INFO ] Deduced a trap composed of 44 places in 590 ms of which 9 ms to minimize.
[2024-05-27 07:54:23] [INFO ] Deduced a trap composed of 41 places in 553 ms of which 10 ms to minimize.
[2024-05-27 07:54:24] [INFO ] Deduced a trap composed of 52 places in 694 ms of which 9 ms to minimize.
[2024-05-27 07:54:24] [INFO ] Deduced a trap composed of 39 places in 713 ms of which 9 ms to minimize.
SMT process timed out in 97031ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 171 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 76 ms. Remains 700 /700 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 700/700 places, 1811/1811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 73 ms. Remains 700 /700 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
[2024-05-27 07:54:24] [INFO ] Flow matrix only has 1475 transitions (discarded 336 similar events)
[2024-05-27 07:54:24] [INFO ] Invariant cache hit.
[2024-05-27 07:54:25] [INFO ] Implicit Places using invariants in 951 ms returned [691]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 954 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 699/700 places, 1811/1811 transitions.
Applied a total of 0 rules in 58 ms. Remains 699 /699 variables (removed 0) and now considering 1811/1811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1087 ms. Remains : 699/700 places, 1811/1811 transitions.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (!p1||G(p2))))))'
Support contains 616 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1985 transition count 2655
Reduce places removed 441 places and 0 transitions.
Iterating post reduction 1 with 441 rules applied. Total rules applied 882 place count 1544 transition count 2655
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 882 place count 1544 transition count 2599
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 994 place count 1488 transition count 2599
Applied a total of 994 rules in 392 ms. Remains 1488 /1985 variables (removed 497) and now considering 2599/3096 (removed 497) transitions.
[2024-05-27 07:54:27] [INFO ] Flow matrix only has 2263 transitions (discarded 336 similar events)
// Phase 1: matrix 2263 rows 1488 cols
[2024-05-27 07:54:27] [INFO ] Computed 24 invariants in 17 ms
[2024-05-27 07:54:28] [INFO ] Implicit Places using invariants in 1207 ms returned [1479]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1212 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1487/1985 places, 2599/3096 transitions.
Applied a total of 0 rules in 65 ms. Remains 1487 /1487 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1673 ms. Remains : 1487/1985 places, 2599/3096 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00
Product exploration timeout after 55260 steps with 1439 reset in 10002 ms.
Stack based approach found an accepted trace after 30 steps with 1 reset with depth 8 and stack size 8 in 12 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 12227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 112 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1985 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1089 transition count 2200
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1792 place count 1089 transition count 1800
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 2592 place count 689 transition count 1800
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2704 place count 633 transition count 1744
Applied a total of 2704 rules in 223 ms. Remains 633 /1985 variables (removed 1352) and now considering 1744/3096 (removed 1352) transitions.
[2024-05-27 07:54:39] [INFO ] Flow matrix only has 1408 transitions (discarded 336 similar events)
// Phase 1: matrix 1408 rows 633 cols
[2024-05-27 07:54:39] [INFO ] Computed 24 invariants in 5 ms
[2024-05-27 07:54:40] [INFO ] Implicit Places using invariants in 998 ms returned [624]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1011 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 632/1985 places, 1744/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 632 /632 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1291 ms. Remains : 632/1985 places, 1744/3096 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 7774 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 8 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 9282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X((X(G(p2))||p1))))))'
Support contains 568 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 116 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:54:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-05-27 07:54:48] [INFO ] Computed 24 invariants in 19 ms
[2024-05-27 07:54:49] [INFO ] Implicit Places using invariants in 1057 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1060 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 68 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1245 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 1560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 72 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 160 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:54:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:54:49] [INFO ] Invariant cache hit.
[2024-05-27 07:54:51] [INFO ] Implicit Places using invariants in 2108 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 146 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2423 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 961 ms.
Stack based approach found an accepted trace after 700 steps with 0 reset with depth 701 and stack size 701 in 6 ms.
FORMULA Peterson-PT-7-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-03 finished in 3623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(p1)))&&X(X(G(p2)))))'
Support contains 168 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:54:53] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:54:53] [INFO ] Invariant cache hit.
[2024-05-27 07:54:54] [INFO ] Implicit Places using invariants in 1245 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1248 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 137 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1474 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) p0), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04
Entered a terminal (fully accepting) state of product in 14 steps with 1 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 1793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(p1) U X(p2)))))'
Support contains 840 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:54:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:54:55] [INFO ] Invariant cache hit.
[2024-05-27 07:54:56] [INFO ] Implicit Places using invariants in 1061 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 66 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1205 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06
Product exploration explored 100000 steps with 7395 reset in 2835 ms.
Stack based approach found an accepted trace after 9673 steps with 713 reset with depth 10 and stack size 10 in 238 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 4662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(G(p0)) U p1)) U p2)))'
Support contains 568 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 78 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:54:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:54:59] [INFO ] Invariant cache hit.
[2024-05-27 07:55:00] [INFO ] Implicit Places using invariants in 781 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 785 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 121 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 985 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 6788 ms.
Stack based approach found an accepted trace after 752 steps with 0 reset with depth 753 and stack size 753 in 43 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 8104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 139 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:55:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:55:07] [INFO ] Invariant cache hit.
[2024-05-27 07:55:09] [INFO ] Implicit Places using invariants in 1745 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1757 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 138 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2037 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 2249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(F(p1)) U p2)))))'
Support contains 2 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 136 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:55:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:55:10] [INFO ] Invariant cache hit.
[2024-05-27 07:55:12] [INFO ] Implicit Places using invariants in 2136 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 146 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2424 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 472 ms.
Product exploration explored 100000 steps with 0 reset in 611 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 556 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 78057 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 78057 steps, saw 50496 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-27 07:55:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-05-27 07:55:17] [INFO ] Computed 23 invariants in 20 ms
[2024-05-27 07:55:17] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 0/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/3211 variables, 7/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3211 variables, 7/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3211 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1533/4744 variables, 1589/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3907 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 3/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:26] [INFO ] Deduced a trap composed of 17 places in 2856 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3204/4744 variables, and 2889 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Domain max(s): 1977/1984 constraints, Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 395/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 9001ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1984 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1089 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1088 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1088 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 641 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 586 transition count 1698
Applied a total of 2796 rules in 280 ms. Remains 586 /1984 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 586/1984 places, 1698/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1273 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227538 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227538 steps, saw 43989 distinct states, run finished after 3006 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-27 07:55:30] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-05-27 07:55:30] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 07:55:30] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1699 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:34] [INFO ] Deduced a trap composed of 59 places in 634 ms of which 8 ms to minimize.
[2024-05-27 07:55:34] [INFO ] Deduced a trap composed of 33 places in 578 ms of which 6 ms to minimize.
[2024-05-27 07:55:35] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 6 ms to minimize.
[2024-05-27 07:55:36] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 8 ms to minimize.
[2024-05-27 07:55:36] [INFO ] Deduced a trap composed of 50 places in 513 ms of which 6 ms to minimize.
[2024-05-27 07:55:37] [INFO ] Deduced a trap composed of 14 places in 693 ms of which 5 ms to minimize.
[2024-05-27 07:55:37] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 8 ms to minimize.
[2024-05-27 07:55:38] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 5 ms to minimize.
[2024-05-27 07:55:38] [INFO ] Deduced a trap composed of 15 places in 551 ms of which 5 ms to minimize.
[2024-05-27 07:55:39] [INFO ] Deduced a trap composed of 88 places in 564 ms of which 5 ms to minimize.
[2024-05-27 07:55:39] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 5 ms to minimize.
[2024-05-27 07:55:40] [INFO ] Deduced a trap composed of 23 places in 576 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 12/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:41] [INFO ] Deduced a trap composed of 11 places in 666 ms of which 9 ms to minimize.
[2024-05-27 07:55:42] [INFO ] Deduced a trap composed of 23 places in 674 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 2/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:42] [INFO ] Deduced a trap composed of 55 places in 573 ms of which 7 ms to minimize.
[2024-05-27 07:55:43] [INFO ] Deduced a trap composed of 64 places in 425 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1633 variables, 2/1333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:44] [INFO ] Deduced a trap composed of 30 places in 648 ms of which 8 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1633 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1633 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 7/1640 variables, 7/1341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1640 variables, 7/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:45] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1640 variables, 1/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1640 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 308/1948 variables, 364/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:55:46] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 5 ms to minimize.
[2024-05-27 07:55:46] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 5 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1948 variables, 2/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15050 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 16796ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9771 steps, including 601 resets, run visited all 3 properties in 99 ms. (steps per millisecond=98 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 110 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 88 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:55:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-05-27 07:55:48] [INFO ] Computed 23 invariants in 15 ms
[2024-05-27 07:55:50] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2024-05-27 07:55:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:55:50] [INFO ] Invariant cache hit.
[2024-05-27 07:55:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 07:56:13] [INFO ] Implicit Places using invariants and state equation in 23047 ms returned []
Implicit Place search using SMT with State Equation took 24755 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-05-27 07:56:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:56:13] [INFO ] Invariant cache hit.
[2024-05-27 07:56:13] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31999ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 32048ms
Finished structural reductions in LTL mode , in 1 iterations and 56917 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 1403 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 108648 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 3
Probabilistic random walk after 108648 steps, saw 70707 distinct states, run finished after 3006 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-27 07:56:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:56:49] [INFO ] Invariant cache hit.
[2024-05-27 07:56:49] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 0/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/3211 variables, 7/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3211 variables, 7/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3211 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1533/4744 variables, 1589/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3674 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 238/240 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/241 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 345/586 variables, 241/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 14/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/985 variables, 56/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 56/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/985 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1622 variables, 98/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1622 variables, 98/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1622 variables, 483/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1622 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1582/3204 variables, 7/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3204 variables, 1582/2885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3204 variables, 3/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:56:57] [INFO ] Deduced a trap composed of 42 places in 2516 ms of which 20 ms to minimize.
[2024-05-27 07:57:00] [INFO ] Deduced a trap composed of 13 places in 2141 ms of which 17 ms to minimize.
SMT process timed out in 10763ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1984 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1089 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1088 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1088 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 641 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 586 transition count 1698
Applied a total of 2796 rules in 193 ms. Remains 586 /1984 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 586/1984 places, 1698/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 204516 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 204516 steps, saw 41375 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-27 07:57:03] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-05-27 07:57:03] [INFO ] Computed 23 invariants in 5 ms
[2024-05-27 07:57:03] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1533 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:57:06] [INFO ] Deduced a trap composed of 59 places in 726 ms of which 9 ms to minimize.
[2024-05-27 07:57:07] [INFO ] Deduced a trap composed of 33 places in 754 ms of which 8 ms to minimize.
[2024-05-27 07:57:08] [INFO ] Deduced a trap composed of 12 places in 730 ms of which 8 ms to minimize.
[2024-05-27 07:57:08] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 8 ms to minimize.
[2024-05-27 07:57:09] [INFO ] Deduced a trap composed of 50 places in 726 ms of which 9 ms to minimize.
[2024-05-27 07:57:10] [INFO ] Deduced a trap composed of 14 places in 616 ms of which 10 ms to minimize.
[2024-05-27 07:57:10] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 5 ms to minimize.
[2024-05-27 07:57:11] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 5 ms to minimize.
[2024-05-27 07:57:11] [INFO ] Deduced a trap composed of 15 places in 703 ms of which 8 ms to minimize.
[2024-05-27 07:57:12] [INFO ] Deduced a trap composed of 88 places in 691 ms of which 8 ms to minimize.
[2024-05-27 07:57:13] [INFO ] Deduced a trap composed of 32 places in 653 ms of which 7 ms to minimize.
[2024-05-27 07:57:14] [INFO ] Deduced a trap composed of 23 places in 761 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 12/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:57:15] [INFO ] Deduced a trap composed of 11 places in 759 ms of which 8 ms to minimize.
[2024-05-27 07:57:15] [INFO ] Deduced a trap composed of 23 places in 607 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 2/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1633 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 7/1640 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 7/1345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:57:17] [INFO ] Deduced a trap composed of 30 places in 653 ms of which 8 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1640 variables, 1/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1640 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 308/1948 variables, 364/1710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 07:57:18] [INFO ] Deduced a trap composed of 47 places in 616 ms of which 7 ms to minimize.
[2024-05-27 07:57:19] [INFO ] Deduced a trap composed of 20 places in 618 ms of which 7 ms to minimize.
[2024-05-27 07:57:20] [INFO ] Deduced a trap composed of 11 places in 685 ms of which 8 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1948 variables, 3/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/1948 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1713 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16147 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 17726ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 10748 steps, including 646 resets, run visited all 1 properties in 63 ms. (steps per millisecond=170 )
Parikh walk visited 3 properties in 128 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Product exploration explored 100000 steps with 0 reset in 588 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1984 transition count 3096
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 504 place count 1984 transition count 3390
Deduced a syphon composed of 904 places in 4 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 904 place count 1984 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1107 place count 1781 transition count 3187
Deduced a syphon composed of 701 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1310 place count 1781 transition count 3187
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1195 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1804 place count 1781 transition count 3187
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2249 place count 1336 transition count 2742
Deduced a syphon composed of 750 places in 2 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2694 place count 1336 transition count 2742
Deduced a syphon composed of 750 places in 1 ms
Applied a total of 2694 rules in 1468 ms. Remains 1336 /1984 variables (removed 648) and now considering 2742/3096 (removed 354) transitions.
[2024-05-27 07:57:26] [INFO ] Redundant transitions in 383 ms returned []
Running 2734 sub problems to find dead transitions.
[2024-05-27 07:57:26] [INFO ] Flow matrix only has 2406 transitions (discarded 336 similar events)
// Phase 1: matrix 2406 rows 1336 cols
[2024-05-27 07:57:26] [INFO ] Computed 23 invariants in 23 ms
[2024-05-27 07:57:26] [INFO ] State equation strengthened by 791 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/3742 variables, and 23 constraints, problems are : Problem set: 0 solved, 2734 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1336 constraints, ReadFeed: 0/791 constraints, PredecessorRefiner: 2734/2734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2734 unsolved
[2024-05-27 07:58:01] [INFO ] Deduced a trap composed of 21 places in 1252 ms of which 13 ms to minimize.
[2024-05-27 07:58:02] [INFO ] Deduced a trap composed of 23 places in 1368 ms of which 18 ms to minimize.
[2024-05-27 07:58:04] [INFO ] Deduced a trap composed of 23 places in 1721 ms of which 17 ms to minimize.
[2024-05-27 07:58:06] [INFO ] Deduced a trap composed of 29 places in 1657 ms of which 18 ms to minimize.
[2024-05-27 07:58:08] [INFO ] Deduced a trap composed of 15 places in 2000 ms of which 19 ms to minimize.
[2024-05-27 07:58:10] [INFO ] Deduced a trap composed of 39 places in 2018 ms of which 19 ms to minimize.
[2024-05-27 07:58:12] [INFO ] Deduced a trap composed of 65 places in 1713 ms of which 16 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-27 07:58:13] [INFO ] Deduced a trap composed of 65 places in 1378 ms of which 14 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-27 07:58:15] [INFO ] Deduced a trap composed of 11 places in 1919 ms of which 17 ms to minimize.
[2024-05-27 07:58:17] [INFO ] Deduced a trap composed of 65 places in 1659 ms of which 17 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-27 07:58:19] [INFO ] Deduced a trap composed of 12 places in 1828 ms of which 18 ms to minimize.
[2024-05-27 07:58:20] [INFO ] Deduced a trap composed of 20 places in 1367 ms of which 10 ms to minimize.
[2024-05-27 07:58:21] [INFO ] Deduced a trap composed of 58 places in 1337 ms of which 13 ms to minimize.
[2024-05-27 07:58:23] [INFO ] Deduced a trap composed of 13 places in 1778 ms of which 17 ms to minimize.
[2024-05-27 07:58:25] [INFO ] Deduced a trap composed of 11 places in 1902 ms of which 18 ms to minimize.
[2024-05-27 07:58:27] [INFO ] Deduced a trap composed of 22 places in 1628 ms of which 11 ms to minimize.
[2024-05-27 07:58:28] [INFO ] Deduced a trap composed of 46 places in 1519 ms of which 16 ms to minimize.
SMT process timed out in 62673ms, After SMT, problems are : Problem set: 0 solved, 2734 unsolved
Search for dead transitions found 0 dead transitions in 62713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1984 places, 2742/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64581 ms. Remains : 1336/1984 places, 2742/3096 transitions.
Built C files in :
/tmp/ltsmin5755105866574788398
[2024-05-27 07:58:29] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5755105866574788398
Running compilation step : cd /tmp/ltsmin5755105866574788398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5755105866574788398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5755105866574788398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 150 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 07:58:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-05-27 07:58:32] [INFO ] Computed 23 invariants in 14 ms
[2024-05-27 07:58:34] [INFO ] Implicit Places using invariants in 2082 ms returned []
[2024-05-27 07:58:34] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:58:34] [INFO ] Invariant cache hit.
[2024-05-27 07:58:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 07:58:57] [INFO ] Implicit Places using invariants and state equation in 23439 ms returned []
Implicit Place search using SMT with State Equation took 25523 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-05-27 07:58:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 07:58:57] [INFO ] Invariant cache hit.
[2024-05-27 07:58:57] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31456ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31498ms
Finished structural reductions in LTL mode , in 1 iterations and 57177 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin11783422720379995219
[2024-05-27 07:59:29] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11783422720379995219
Running compilation step : cd /tmp/ltsmin11783422720379995219;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11783422720379995219;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11783422720379995219;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 07:59:32] [INFO ] Flatten gal took : 104 ms
[2024-05-27 07:59:32] [INFO ] Flatten gal took : 99 ms
[2024-05-27 07:59:32] [INFO ] Time to serialize gal into /tmp/LTL3339468105148243572.gal : 51 ms
[2024-05-27 07:59:33] [INFO ] Time to serialize properties into /tmp/LTL3933533745822401646.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3339468105148243572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16372112544079908270.hoa' '-atoms' '/tmp/LTL3933533745822401646.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3933533745822401646.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16372112544079908270.hoa
Detected timeout of ITS tools.
[2024-05-27 07:59:48] [INFO ] Flatten gal took : 140 ms
[2024-05-27 07:59:48] [INFO ] Flatten gal took : 144 ms
[2024-05-27 07:59:48] [INFO ] Time to serialize gal into /tmp/LTL8350375441143749668.gal : 32 ms
[2024-05-27 07:59:48] [INFO ] Time to serialize properties into /tmp/LTL18001286537564540570.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8350375441143749668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18001286537564540570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(IsEndLoop_6_2_7==0)")||(X((G(F("(IsEndLoop_6_0_4==1)")))U("(IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(IsEndLoop_6_2_7==0)" & X(FG!"(IsEndLoop_6_0_4==1)" R !"(IsEndLoop_6_2_7==1)"))
Detected timeout of ITS tools.
[2024-05-27 08:00:03] [INFO ] Flatten gal took : 81 ms
[2024-05-27 08:00:03] [INFO ] Applying decomposition
[2024-05-27 08:00:03] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6173353828407228604.txt' '-o' '/tmp/graph6173353828407228604.bin' '-w' '/tmp/graph6173353828407228604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6173353828407228604.bin' '-l' '-1' '-v' '-w' '/tmp/graph6173353828407228604.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:00:04] [INFO ] Decomposing Gal with order
[2024-05-27 08:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:00:05] [INFO ] Removed a total of 2840 redundant transitions.
[2024-05-27 08:00:05] [INFO ] Flatten gal took : 300 ms
[2024-05-27 08:00:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-27 08:00:05] [INFO ] Time to serialize gal into /tmp/LTL6187164820343802131.gal : 41 ms
[2024-05-27 08:00:05] [INFO ] Time to serialize properties into /tmp/LTL9962298418751330606.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6187164820343802131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9962298418751330606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i18.u546.IsEndLoop_6_2_7==0)")||(X((G(F("(i10.u369.IsEndLoop_6_0_4==1)")))U("(i18.u546.IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(i18.u546.IsEndLoop_6_2_7==0)" & X(FG!"(i10.u369.IsEndLoop_6_0_4==1)" R !"(i18.u546.IsEndLoop_6_2_7==1)"))
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 310301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(G(p1)) U G(p2)))))'
Support contains 4 out of 1985 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 1985 transition count 2204
Reduce places removed 892 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 894 rules applied. Total rules applied 1786 place count 1093 transition count 2202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1788 place count 1091 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1788 place count 1091 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2680 place count 645 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2792 place count 589 transition count 1700
Applied a total of 2792 rules in 186 ms. Remains 589 /1985 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2024-05-27 08:00:20] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 589 cols
[2024-05-27 08:00:20] [INFO ] Computed 24 invariants in 7 ms
[2024-05-27 08:00:21] [INFO ] Implicit Places using invariants in 1078 ms returned [580]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/1985 places, 1700/3096 transitions.
Applied a total of 0 rules in 48 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1317 ms. Remains : 588/1985 places, 1700/3096 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 561 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-10 finished in 2229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 139 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 08:00:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1985 cols
[2024-05-27 08:00:22] [INFO ] Computed 24 invariants in 14 ms
[2024-05-27 08:00:24] [INFO ] Implicit Places using invariants in 1918 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1923 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 162 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2225 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11
Product exploration explored 100000 steps with 157 reset in 513 ms.
Stack based approach found an accepted trace after 448 steps with 0 reset with depth 449 and stack size 449 in 3 ms.
FORMULA Peterson-PT-7-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 2948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p0&&G(p1)))&&(p2 U X(G(p3)))))))'
Support contains 5 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 158 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-27 08:00:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-27 08:00:25] [INFO ] Invariant cache hit.
[2024-05-27 08:00:27] [INFO ] Implicit Places using invariants in 1914 ms returned [1976]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1919 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1985 places, 3096/3096 transitions.
Applied a total of 0 rules in 166 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2244 ms. Remains : 1984/1985 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 2611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(F(p1)) U p2)))))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLFireability-09
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 1985 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1985/1985 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1985 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1090 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1089 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1792 place count 1089 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2686 place count 642 transition count 1753
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2796 place count 587 transition count 1698
Applied a total of 2796 rules in 182 ms. Remains 587 /1985 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2024-05-27 08:00:28] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 587 cols
[2024-05-27 08:00:28] [INFO ] Computed 24 invariants in 5 ms
[2024-05-27 08:00:29] [INFO ] Implicit Places using invariants in 1191 ms returned [578]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 586/1985 places, 1698/3096 transitions.
Applied a total of 0 rules in 25 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1402 ms. Remains : 586/1985 places, 1698/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 488 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 469 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 396225 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 3
Probabilistic random walk after 396225 steps, saw 60698 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-27 08:00:34] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-05-27 08:00:34] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 08:00:34] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1709 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 08:00:37] [INFO ] Deduced a trap composed of 59 places in 752 ms of which 8 ms to minimize.
[2024-05-27 08:00:38] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 6 ms to minimize.
[2024-05-27 08:00:39] [INFO ] Deduced a trap composed of 12 places in 502 ms of which 6 ms to minimize.
[2024-05-27 08:00:39] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 8 ms to minimize.
[2024-05-27 08:00:40] [INFO ] Deduced a trap composed of 50 places in 473 ms of which 5 ms to minimize.
[2024-05-27 08:00:41] [INFO ] Deduced a trap composed of 14 places in 618 ms of which 8 ms to minimize.
[2024-05-27 08:00:41] [INFO ] Deduced a trap composed of 17 places in 461 ms of which 6 ms to minimize.
SMT process timed out in 7051ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 30 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 586/586 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 309411 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 3
Probabilistic random walk after 309411 steps, saw 52865 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-27 08:00:44] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:00:44] [INFO ] Invariant cache hit.
[2024-05-27 08:00:44] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1517 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 08:00:48] [INFO ] Deduced a trap composed of 21 places in 707 ms of which 7 ms to minimize.
[2024-05-27 08:00:48] [INFO ] Deduced a trap composed of 41 places in 676 ms of which 7 ms to minimize.
[2024-05-27 08:00:49] [INFO ] Deduced a trap composed of 43 places in 647 ms of which 7 ms to minimize.
[2024-05-27 08:00:50] [INFO ] Deduced a trap composed of 12 places in 490 ms of which 5 ms to minimize.
[2024-05-27 08:00:50] [INFO ] Deduced a trap composed of 23 places in 779 ms of which 9 ms to minimize.
[2024-05-27 08:00:51] [INFO ] Deduced a trap composed of 11 places in 718 ms of which 9 ms to minimize.
[2024-05-27 08:00:52] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 5 ms to minimize.
[2024-05-27 08:00:53] [INFO ] Deduced a trap composed of 22 places in 739 ms of which 8 ms to minimize.
[2024-05-27 08:00:53] [INFO ] Deduced a trap composed of 78 places in 583 ms of which 7 ms to minimize.
[2024-05-27 08:00:54] [INFO ] Deduced a trap composed of 14 places in 596 ms of which 8 ms to minimize.
[2024-05-27 08:00:54] [INFO ] Deduced a trap composed of 17 places in 550 ms of which 7 ms to minimize.
[2024-05-27 08:00:55] [INFO ] Deduced a trap composed of 42 places in 582 ms of which 5 ms to minimize.
[2024-05-27 08:00:56] [INFO ] Deduced a trap composed of 24 places in 692 ms of which 7 ms to minimize.
[2024-05-27 08:00:56] [INFO ] Deduced a trap composed of 15 places in 556 ms of which 5 ms to minimize.
[2024-05-27 08:00:57] [INFO ] Deduced a trap composed of 30 places in 668 ms of which 6 ms to minimize.
[2024-05-27 08:00:58] [INFO ] Deduced a trap composed of 45 places in 766 ms of which 9 ms to minimize.
[2024-05-27 08:00:59] [INFO ] Deduced a trap composed of 15 places in 762 ms of which 9 ms to minimize.
[2024-05-27 08:00:59] [INFO ] Deduced a trap composed of 14 places in 637 ms of which 8 ms to minimize.
[2024-05-27 08:01:00] [INFO ] Deduced a trap composed of 46 places in 692 ms of which 8 ms to minimize.
[2024-05-27 08:01:01] [INFO ] Deduced a trap composed of 21 places in 765 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 7/1640 variables, 7/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1640 variables, 7/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 308/1948 variables, 364/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16315 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 17854ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 57 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 586/586 places, 1698/1698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 53 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-05-27 08:01:03] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:01:03] [INFO ] Invariant cache hit.
[2024-05-27 08:01:03] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-05-27 08:01:03] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:01:03] [INFO ] Invariant cache hit.
[2024-05-27 08:01:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 08:01:08] [INFO ] Implicit Places using invariants and state equation in 4071 ms returned []
Implicit Place search using SMT with State Equation took 4959 ms to find 0 implicit places.
[2024-05-27 08:01:08] [INFO ] Redundant transitions in 124 ms returned []
Running 1690 sub problems to find dead transitions.
[2024-05-27 08:01:08] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:01:08] [INFO ] Invariant cache hit.
[2024-05-27 08:01:08] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
SMT process timed out in 30775ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 30796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35944 ms. Remains : 586/586 places, 1698/1698 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1286 edges and 586 vertex of which 446 / 586 are part of one of the 56 SCC in 7 ms
Free SCC test removed 390 places
Drop transitions (Empty/Sink Transition effects.) removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 196 transition count 474
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 142 transition count 474
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 140 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 137 place count 124 transition count 463
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 153 place count 116 transition count 455
Graph (trivial) has 58 edges and 116 vertex of which 58 / 116 are part of one of the 8 SCC in 0 ms
Free SCC test removed 50 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 161 place count 59 transition count 455
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 403 edges and 59 vertex of which 3 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.15 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 0 with 60 rules applied. Total rules applied 221 place count 3 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 270 place count 3 transition count 4
Applied a total of 270 rules in 215 ms. Remains 3 /586 variables (removed 583) and now considering 4/1698 (removed 1694) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 3 cols
[2024-05-27 08:01:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 08:01:39] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 08:01:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 08:01:39] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-27 08:01:39] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-27 08:01:39] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 457 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 31 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-05-27 08:01:40] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-05-27 08:01:40] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 08:01:41] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-27 08:01:41] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:01:41] [INFO ] Invariant cache hit.
[2024-05-27 08:01:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 08:01:45] [INFO ] Implicit Places using invariants and state equation in 4436 ms returned []
Implicit Place search using SMT with State Equation took 5425 ms to find 0 implicit places.
Running 1690 sub problems to find dead transitions.
[2024-05-27 08:01:45] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:01:45] [INFO ] Invariant cache hit.
[2024-05-27 08:01:45] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
SMT process timed out in 30864ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 30885ms
Finished structural reductions in LTL mode , in 1 iterations and 36346 ms. Remains : 586/586 places, 1698/1698 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 386109 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 3
Probabilistic random walk after 386109 steps, saw 59757 distinct states, run finished after 3003 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-27 08:02:20] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:02:20] [INFO ] Invariant cache hit.
[2024-05-27 08:02:20] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1219 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 08:02:22] [INFO ] Deduced a trap composed of 21 places in 489 ms of which 5 ms to minimize.
[2024-05-27 08:02:23] [INFO ] Deduced a trap composed of 41 places in 489 ms of which 5 ms to minimize.
[2024-05-27 08:02:23] [INFO ] Deduced a trap composed of 43 places in 599 ms of which 6 ms to minimize.
[2024-05-27 08:02:24] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 5 ms to minimize.
[2024-05-27 08:02:24] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 5 ms to minimize.
[2024-05-27 08:02:25] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 5 ms to minimize.
[2024-05-27 08:02:25] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 5 ms to minimize.
[2024-05-27 08:02:26] [INFO ] Deduced a trap composed of 22 places in 436 ms of which 5 ms to minimize.
[2024-05-27 08:02:26] [INFO ] Deduced a trap composed of 78 places in 442 ms of which 5 ms to minimize.
SMT process timed out in 6656ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 30 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 586/586 places, 1698/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 931 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 365355 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 3
Probabilistic random walk after 365355 steps, saw 57945 distinct states, run finished after 3003 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-27 08:02:30] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:02:30] [INFO ] Invariant cache hit.
[2024-05-27 08:02:30] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 7/1640 variables, 7/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1640 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1640 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 308/1948 variables, 364/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1948 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 1692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1591 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 65/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 172/240 variables, 68/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 399/639 variables, 56/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 637/1276 variables, 98/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 98/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1276 variables, 483/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1276 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 357/1633 variables, 7/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1633 variables, 357/1314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1633 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 08:02:33] [INFO ] Deduced a trap composed of 21 places in 696 ms of which 8 ms to minimize.
[2024-05-27 08:02:34] [INFO ] Deduced a trap composed of 41 places in 815 ms of which 9 ms to minimize.
[2024-05-27 08:02:35] [INFO ] Deduced a trap composed of 43 places in 818 ms of which 9 ms to minimize.
[2024-05-27 08:02:35] [INFO ] Deduced a trap composed of 12 places in 782 ms of which 8 ms to minimize.
[2024-05-27 08:02:36] [INFO ] Deduced a trap composed of 23 places in 736 ms of which 9 ms to minimize.
[2024-05-27 08:02:37] [INFO ] Deduced a trap composed of 11 places in 749 ms of which 8 ms to minimize.
[2024-05-27 08:02:38] [INFO ] Deduced a trap composed of 31 places in 754 ms of which 8 ms to minimize.
[2024-05-27 08:02:38] [INFO ] Deduced a trap composed of 22 places in 616 ms of which 8 ms to minimize.
[2024-05-27 08:02:39] [INFO ] Deduced a trap composed of 78 places in 691 ms of which 7 ms to minimize.
[2024-05-27 08:02:40] [INFO ] Deduced a trap composed of 14 places in 607 ms of which 6 ms to minimize.
[2024-05-27 08:02:40] [INFO ] Deduced a trap composed of 17 places in 574 ms of which 5 ms to minimize.
[2024-05-27 08:02:41] [INFO ] Deduced a trap composed of 42 places in 666 ms of which 8 ms to minimize.
[2024-05-27 08:02:42] [INFO ] Deduced a trap composed of 24 places in 709 ms of which 8 ms to minimize.
[2024-05-27 08:02:43] [INFO ] Deduced a trap composed of 15 places in 625 ms of which 7 ms to minimize.
[2024-05-27 08:02:43] [INFO ] Deduced a trap composed of 30 places in 759 ms of which 8 ms to minimize.
[2024-05-27 08:02:44] [INFO ] Deduced a trap composed of 45 places in 621 ms of which 6 ms to minimize.
[2024-05-27 08:02:45] [INFO ] Deduced a trap composed of 15 places in 780 ms of which 8 ms to minimize.
[2024-05-27 08:02:46] [INFO ] Deduced a trap composed of 14 places in 687 ms of which 8 ms to minimize.
[2024-05-27 08:02:46] [INFO ] Deduced a trap composed of 46 places in 673 ms of which 8 ms to minimize.
[2024-05-27 08:02:47] [INFO ] Deduced a trap composed of 21 places in 769 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1633 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1633 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 7/1640 variables, 7/1344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1640 variables, 7/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1640 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 308/1948 variables, 364/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1948 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 1715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17525 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 586/586 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints]
After SMT, in 19137ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 421 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 586 transition count 1697
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 585 transition count 1697
Applied a total of 2 rules in 59 ms. Remains 585 /586 variables (removed 1) and now considering 1697/1698 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 585/586 places, 1697/1698 transitions.
RANDOM walk for 40000 steps (8 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 580284 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 1
Probabilistic random walk after 580284 steps, saw 82995 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2024-05-27 08:02:52] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
// Phase 1: matrix 1361 rows 585 cols
[2024-05-27 08:02:52] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 08:02:52] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 171/238 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/637 variables, 56/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1274 variables, 98/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 98/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 483/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1274 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1631 variables, 7/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1631 variables, 357/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1631 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1638 variables, 7/1319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1638 variables, 7/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1638 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1946 variables, 364/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1946 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1946 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 1690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1103 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 585/585 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 65/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 171/238 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/637 variables, 56/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1274 variables, 98/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 98/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 483/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1274 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1631 variables, 7/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1631 variables, 357/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1631 variables, 1/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 08:02:55] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 8 ms to minimize.
[2024-05-27 08:02:56] [INFO ] Deduced a trap composed of 11 places in 798 ms of which 8 ms to minimize.
[2024-05-27 08:02:57] [INFO ] Deduced a trap composed of 30 places in 816 ms of which 8 ms to minimize.
[2024-05-27 08:02:58] [INFO ] Deduced a trap composed of 41 places in 694 ms of which 9 ms to minimize.
[2024-05-27 08:02:58] [INFO ] Deduced a trap composed of 45 places in 745 ms of which 8 ms to minimize.
[2024-05-27 08:02:59] [INFO ] Deduced a trap composed of 61 places in 716 ms of which 9 ms to minimize.
[2024-05-27 08:03:00] [INFO ] Deduced a trap composed of 33 places in 818 ms of which 9 ms to minimize.
[2024-05-27 08:03:01] [INFO ] Deduced a trap composed of 23 places in 764 ms of which 9 ms to minimize.
[2024-05-27 08:03:01] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 8 ms to minimize.
[2024-05-27 08:03:02] [INFO ] Deduced a trap composed of 22 places in 791 ms of which 8 ms to minimize.
[2024-05-27 08:03:03] [INFO ] Deduced a trap composed of 23 places in 766 ms of which 9 ms to minimize.
[2024-05-27 08:03:04] [INFO ] Deduced a trap composed of 25 places in 815 ms of which 13 ms to minimize.
[2024-05-27 08:03:05] [INFO ] Deduced a trap composed of 16 places in 767 ms of which 8 ms to minimize.
[2024-05-27 08:03:06] [INFO ] Deduced a trap composed of 47 places in 751 ms of which 8 ms to minimize.
[2024-05-27 08:03:06] [INFO ] Deduced a trap composed of 23 places in 707 ms of which 8 ms to minimize.
[2024-05-27 08:03:07] [INFO ] Deduced a trap composed of 63 places in 735 ms of which 8 ms to minimize.
[2024-05-27 08:03:08] [INFO ] Deduced a trap composed of 14 places in 739 ms of which 8 ms to minimize.
[2024-05-27 08:03:09] [INFO ] Deduced a trap composed of 59 places in 729 ms of which 8 ms to minimize.
[2024-05-27 08:03:09] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1631 variables, 19/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1631 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/1638 variables, 7/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1638 variables, 7/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1638 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1946 variables, 364/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1946 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1946 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 1710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16631 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 585/585 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 17752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1697/1697 transitions.
Applied a total of 0 rules in 49 ms. Remains 585 /585 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 585/585 places, 1697/1697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1697/1697 transitions.
Applied a total of 0 rules in 46 ms. Remains 585 /585 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
[2024-05-27 08:03:10] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-05-27 08:03:10] [INFO ] Invariant cache hit.
[2024-05-27 08:03:11] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-27 08:03:11] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-05-27 08:03:11] [INFO ] Invariant cache hit.
[2024-05-27 08:03:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 08:03:18] [INFO ] Implicit Places using invariants and state equation in 6225 ms returned []
Implicit Place search using SMT with State Equation took 7317 ms to find 0 implicit places.
[2024-05-27 08:03:18] [INFO ] Redundant transitions in 82 ms returned []
Running 1689 sub problems to find dead transitions.
[2024-05-27 08:03:18] [INFO ] Flow matrix only has 1361 transitions (discarded 336 similar events)
[2024-05-27 08:03:18] [INFO ] Invariant cache hit.
[2024-05-27 08:03:18] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 585/585 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
SMT process timed out in 30953ms, After SMT, problems are : Problem set: 0 solved, 1689 unsolved
Search for dead transitions found 0 dead transitions in 30987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38450 ms. Remains : 585/585 places, 1697/1697 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 585 vertex of which 448 / 585 are part of one of the 56 SCC in 1 ms
Free SCC test removed 392 places
Drop transitions (Empty/Sink Transition effects.) removed 784 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1175 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 193 transition count 467
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 138 transition count 467
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 135 place count 122 transition count 459
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 151 place count 114 transition count 451
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 159 place count 58 transition count 451
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 217 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 266 place count 2 transition count 2
Applied a total of 266 rules in 23 ms. Remains 2 /585 variables (removed 583) and now considering 2/1697 (removed 1695) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-05-27 08:03:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 08:03:49] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 08:03:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 08:03:49] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 08:03:49] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 08:03:49] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 473 ms.
Product exploration explored 100000 steps with 0 reset in 526 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 43 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-05-27 08:03:51] [INFO ] Redundant transitions in 55 ms returned []
Running 1690 sub problems to find dead transitions.
[2024-05-27 08:03:51] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 586 cols
[2024-05-27 08:03:51] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 08:03:51] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1948 variables, and 609 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30052 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/586 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1690/1690 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
[2024-05-27 08:04:26] [INFO ] Deduced a trap composed of 72 places in 747 ms of which 8 ms to minimize.
[2024-05-27 08:04:27] [INFO ] Deduced a trap composed of 61 places in 777 ms of which 9 ms to minimize.
[2024-05-27 08:04:27] [INFO ] Deduced a trap composed of 24 places in 772 ms of which 9 ms to minimize.
[2024-05-27 08:04:28] [INFO ] Deduced a trap composed of 11 places in 773 ms of which 8 ms to minimize.
[2024-05-27 08:04:29] [INFO ] Deduced a trap composed of 33 places in 738 ms of which 8 ms to minimize.
[2024-05-27 08:04:30] [INFO ] Deduced a trap composed of 22 places in 719 ms of which 8 ms to minimize.
[2024-05-27 08:04:30] [INFO ] Deduced a trap composed of 55 places in 726 ms of which 8 ms to minimize.
[2024-05-27 08:04:31] [INFO ] Deduced a trap composed of 70 places in 734 ms of which 8 ms to minimize.
[2024-05-27 08:04:32] [INFO ] Deduced a trap composed of 70 places in 737 ms of which 8 ms to minimize.
[2024-05-27 08:04:33] [INFO ] Deduced a trap composed of 57 places in 720 ms of which 8 ms to minimize.
[2024-05-27 08:04:33] [INFO ] Deduced a trap composed of 23 places in 732 ms of which 8 ms to minimize.
[2024-05-27 08:04:34] [INFO ] Deduced a trap composed of 20 places in 755 ms of which 9 ms to minimize.
[2024-05-27 08:04:35] [INFO ] Deduced a trap composed of 46 places in 739 ms of which 11 ms to minimize.
[2024-05-27 08:04:36] [INFO ] Deduced a trap composed of 23 places in 727 ms of which 8 ms to minimize.
[2024-05-27 08:04:36] [INFO ] Deduced a trap composed of 30 places in 642 ms of which 9 ms to minimize.
[2024-05-27 08:04:37] [INFO ] Deduced a trap composed of 19 places in 605 ms of which 8 ms to minimize.
[2024-05-27 08:04:38] [INFO ] Deduced a trap composed of 27 places in 597 ms of which 8 ms to minimize.
[2024-05-27 08:04:38] [INFO ] Deduced a trap composed of 33 places in 665 ms of which 7 ms to minimize.
[2024-05-27 08:04:39] [INFO ] Deduced a trap composed of 59 places in 637 ms of which 5 ms to minimize.
[2024-05-27 08:04:40] [INFO ] Deduced a trap composed of 20 places in 697 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
[2024-05-27 08:04:41] [INFO ] Deduced a trap composed of 20 places in 488 ms of which 5 ms to minimize.
[2024-05-27 08:04:42] [INFO ] Deduced a trap composed of 12 places in 646 ms of which 5 ms to minimize.
[2024-05-27 08:04:42] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 5 ms to minimize.
[2024-05-27 08:04:43] [INFO ] Deduced a trap composed of 12 places in 491 ms of which 6 ms to minimize.
[2024-05-27 08:04:43] [INFO ] Deduced a trap composed of 12 places in 588 ms of which 7 ms to minimize.
[2024-05-27 08:04:44] [INFO ] Deduced a trap composed of 13 places in 589 ms of which 7 ms to minimize.
[2024-05-27 08:04:44] [INFO ] Deduced a trap composed of 14 places in 564 ms of which 6 ms to minimize.
[2024-05-27 08:04:45] [INFO ] Deduced a trap composed of 20 places in 537 ms of which 6 ms to minimize.
[2024-05-27 08:04:46] [INFO ] Deduced a trap composed of 15 places in 613 ms of which 6 ms to minimize.
[2024-05-27 08:04:46] [INFO ] Deduced a trap composed of 25 places in 471 ms of which 5 ms to minimize.
[2024-05-27 08:04:47] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 5 ms to minimize.
[2024-05-27 08:04:47] [INFO ] Deduced a trap composed of 20 places in 511 ms of which 6 ms to minimize.
[2024-05-27 08:04:48] [INFO ] Deduced a trap composed of 20 places in 599 ms of which 6 ms to minimize.
[2024-05-27 08:04:48] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 5 ms to minimize.
[2024-05-27 08:04:49] [INFO ] Deduced a trap composed of 64 places in 651 ms of which 8 ms to minimize.
[2024-05-27 08:04:50] [INFO ] Deduced a trap composed of 50 places in 500 ms of which 6 ms to minimize.
[2024-05-27 08:04:50] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 5 ms to minimize.
[2024-05-27 08:04:51] [INFO ] Deduced a trap composed of 35 places in 542 ms of which 8 ms to minimize.
[2024-05-27 08:04:51] [INFO ] Deduced a trap composed of 70 places in 610 ms of which 6 ms to minimize.
[2024-05-27 08:04:52] [INFO ] Deduced a trap composed of 93 places in 626 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1948 variables, and 649 constraints, problems are : Problem set: 0 solved, 1690 unsolved in 30039 ms.
Refiners :[Domain max(s): 586/586 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/586 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/1690 constraints, Known Traps: 40/40 constraints]
After SMT, in 60850ms problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60993 ms. Remains : 586/586 places, 1698/1698 transitions.
Built C files in :
/tmp/ltsmin14501625227620159150
[2024-05-27 08:04:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14501625227620159150
Running compilation step : cd /tmp/ltsmin14501625227620159150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14501625227620159150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14501625227620159150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 1698/1698 transitions.
Applied a total of 0 rules in 22 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
[2024-05-27 08:04:55] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:04:55] [INFO ] Invariant cache hit.
[2024-05-27 08:04:56] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-05-27 08:04:56] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:04:56] [INFO ] Invariant cache hit.
[2024-05-27 08:04:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-27 08:05:00] [INFO ] Implicit Places using invariants and state equation in 4260 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Running 1690 sub problems to find dead transitions.
[2024-05-27 08:05:00] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
[2024-05-27 08:05:00] [INFO ] Invariant cache hit.
[2024-05-27 08:05:00] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 586/586 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 1690 unsolved
[2024-05-27 08:05:29] [INFO ] Deduced a trap composed of 72 places in 753 ms of which 9 ms to minimize.
[2024-05-27 08:05:30] [INFO ] Deduced a trap composed of 49 places in 796 ms of which 9 ms to minimize.
[2024-05-27 08:05:30] [INFO ] Deduced a trap composed of 55 places in 658 ms of which 8 ms to minimize.
[2024-05-27 08:05:31] [INFO ] Deduced a trap composed of 88 places in 764 ms of which 9 ms to minimize.
[2024-05-27 08:05:32] [INFO ] Deduced a trap composed of 12 places in 804 ms of which 9 ms to minimize.
SMT process timed out in 31682ms, After SMT, problems are : Problem set: 0 solved, 1690 unsolved
Search for dead transitions found 0 dead transitions in 31717ms
Finished structural reductions in LTL mode , in 1 iterations and 37009 ms. Remains : 586/586 places, 1698/1698 transitions.
Built C files in :
/tmp/ltsmin4559620713977135480
[2024-05-27 08:05:32] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4559620713977135480
Running compilation step : cd /tmp/ltsmin4559620713977135480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4559620713977135480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4559620713977135480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 08:05:35] [INFO ] Flatten gal took : 70 ms
[2024-05-27 08:05:35] [INFO ] Flatten gal took : 85 ms
[2024-05-27 08:05:36] [INFO ] Time to serialize gal into /tmp/LTL894773109625943903.gal : 14 ms
[2024-05-27 08:05:36] [INFO ] Time to serialize properties into /tmp/LTL438687475899839832.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL894773109625943903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12389369149115954961.hoa' '-atoms' '/tmp/LTL438687475899839832.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL438687475899839832.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12389369149115954961.hoa
Detected timeout of ITS tools.
[2024-05-27 08:05:51] [INFO ] Flatten gal took : 41 ms
[2024-05-27 08:05:51] [INFO ] Flatten gal took : 65 ms
[2024-05-27 08:05:51] [INFO ] Time to serialize gal into /tmp/LTL18251204741476612224.gal : 15 ms
[2024-05-27 08:05:51] [INFO ] Time to serialize properties into /tmp/LTL8813580740701446307.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18251204741476612224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8813580740701446307.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(IsEndLoop_6_2_7==0)")||(X((G(F("(IsEndLoop_6_0_4==1)")))U("(IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(IsEndLoop_6_2_7==0)" & X(FG!"(IsEndLoop_6_0_4==1)" R !"(IsEndLoop_6_2_7==1)"))
Detected timeout of ITS tools.
[2024-05-27 08:06:06] [INFO ] Flatten gal took : 38 ms
[2024-05-27 08:06:06] [INFO ] Applying decomposition
[2024-05-27 08:06:06] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11001719085676584392.txt' '-o' '/tmp/graph11001719085676584392.bin' '-w' '/tmp/graph11001719085676584392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11001719085676584392.bin' '-l' '-1' '-v' '-w' '/tmp/graph11001719085676584392.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:06:06] [INFO ] Decomposing Gal with order
[2024-05-27 08:06:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:06:06] [INFO ] Removed a total of 2497 redundant transitions.
[2024-05-27 08:06:06] [INFO ] Flatten gal took : 99 ms
[2024-05-27 08:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 935 labels/synchronizations in 129 ms.
[2024-05-27 08:06:06] [INFO ] Time to serialize gal into /tmp/LTL11869344674711039055.gal : 22 ms
[2024-05-27 08:06:06] [INFO ] Time to serialize properties into /tmp/LTL17674991044593760339.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11869344674711039055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17674991044593760339.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i11.u52.IsEndLoop_6_2_7==0)")||(X((G(F("(i9.u0.IsEndLoop_6_0_4==1)")))U("(i11.u52.IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(i11.u52.IsEndLoop_6_2_7==0)" & X(FG!"(i9.u0.IsEndLoop_6_0_4==1)" R !"(i11.u52.IsEndLoop_6_2_7==1)"))
Detected timeout of ITS tools.
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 353744 ms.
[2024-05-27 08:06:21] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11126935469356609081
[2024-05-27 08:06:22] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2024-05-27 08:06:22] [INFO ] Applying decomposition
[2024-05-27 08:06:22] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11126935469356609081
Running compilation step : cd /tmp/ltsmin11126935469356609081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 08:06:22] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8937589773203465419.txt' '-o' '/tmp/graph8937589773203465419.bin' '-w' '/tmp/graph8937589773203465419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8937589773203465419.bin' '-l' '-1' '-v' '-w' '/tmp/graph8937589773203465419.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:06:22] [INFO ] Decomposing Gal with order
[2024-05-27 08:06:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:06:22] [INFO ] Removed a total of 2839 redundant transitions.
[2024-05-27 08:06:22] [INFO ] Flatten gal took : 143 ms
[2024-05-27 08:06:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-27 08:06:23] [INFO ] Time to serialize gal into /tmp/LTLFireability15830934919590640424.gal : 28 ms
[2024-05-27 08:06:23] [INFO ] Time to serialize properties into /tmp/LTLFireability16107277272946728728.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15830934919590640424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16107277272946728728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("(i12.u159.IsEndLoop_6_2_7==0)")||(X((G(F("(i29.u382.IsEndLoop_6_0_4==1)")))U("(i12.u159.IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(i12.u159.IsEndLoop_6_2_7==0)" & X(FG!"(i29.u382.IsEndLoop_6_0_4==1)" R !"(i12.u159.IsEndLoop_6_2_7==1)"))
Compilation finished in 16959 ms.
Running link step : cd /tmp/ltsmin11126935469356609081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin11126935469356609081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(([](<>((LTLAPp1==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 08:23:56] [INFO ] Applying decomposition
[2024-05-27 08:23:56] [INFO ] Flatten gal took : 160 ms
[2024-05-27 08:23:56] [INFO ] Decomposing Gal with order
[2024-05-27 08:23:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:23:57] [INFO ] Removed a total of 2070 redundant transitions.
[2024-05-27 08:23:58] [INFO ] Flatten gal took : 927 ms
[2024-05-27 08:23:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 994 labels/synchronizations in 350 ms.
[2024-05-27 08:23:58] [INFO ] Time to serialize gal into /tmp/LTLFireability12445656767448310449.gal : 73 ms
[2024-05-27 08:23:58] [INFO ] Time to serialize properties into /tmp/LTLFireability12466860371801026383.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12445656767448310449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12466860371801026383.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("(u2.IsEndLoop_6_2_7==0)")||(X((G(F("(u2.IsEndLoop_6_0_4==1)")))U("(u2.IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(u2.IsEndLoop_6_2_7==0)" & X(FG!"(u2.IsEndLoop_6_0_4==1)" R !"(u2.IsEndLoop_6_2_7==1)"))
Detected timeout of ITS tools.
[2024-05-27 08:49:02] [INFO ] Flatten gal took : 155 ms
[2024-05-27 08:49:02] [INFO ] Input system was already deterministic with 3096 transitions.
[2024-05-27 08:49:02] [INFO ] Transformed 1985 places.
[2024-05-27 08:49:02] [INFO ] Transformed 3096 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 08:49:04] [INFO ] Time to serialize gal into /tmp/LTLFireability4883741038891635974.gal : 36 ms
[2024-05-27 08:49:04] [INFO ] Time to serialize properties into /tmp/LTLFireability17703994589727430683.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4883741038891635974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17703994589727430683.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(IsEndLoop_6_2_7==0)")||(X((G(F("(IsEndLoop_6_0_4==1)")))U("(IsEndLoop_6_2_7==1)"))))))
Formula 0 simplified : F(!"(IsEndLoop_6_2_7==0)" & X(FG!"(IsEndLoop_6_0_4==1)" R !"(IsEndLoop_6_2_7==1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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