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.r355-tall-171683760000986.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 greatspnxred
Input is ShieldRVt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760000986
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 239K 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 ShieldRVt-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717078789183

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:19:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 14:19:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:19:50] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-30 14:19:50] [INFO ] Transformed 1003 places.
[2024-05-30 14:19:50] [INFO ] Transformed 1003 transitions.
[2024-05-30 14:19:50] [INFO ] Found NUPN structural information;
[2024-05-30 14:19:50] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 809 transition count 809
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 809 transition count 809
Applied a total of 388 rules in 147 ms. Remains 809 /1003 variables (removed 194) and now considering 809/1003 (removed 194) transitions.
// Phase 1: matrix 809 rows 809 cols
[2024-05-30 14:19:50] [INFO ] Computed 81 invariants in 24 ms
[2024-05-30 14:19:51] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-30 14:19:51] [INFO ] Invariant cache hit.
[2024-05-30 14:19:51] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-30 14:19:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:20:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 12 ms to minimize.
[2024-05-30 14:20:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:20:11] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:20:12] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:20:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:20:14] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 5 ms to minimize.
[2024-05-30 14:20:14] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:20:14] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-05-30 14:20:14] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:15] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:20:15] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:20:16] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:20:16] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:20:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:20:21] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 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 Real declared 809/1618 variables, and 103 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/809 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 22/103 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:20:36] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:20:37] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:20:38] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:38] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:20:39] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:20:40] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:20:40] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:20:40] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:41] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:20:41] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:20:41] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:20:49] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:20:49] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:20:50] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/1618 variables, and 124 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/809 constraints, PredecessorRefiner: 0/808 constraints, Known Traps: 43/43 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 809/1003 places, 809/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61317 ms. Remains : 809/1003 places, 809/1003 transitions.
Support contains 113 out of 809 places after structural reductions.
[2024-05-30 14:20:52] [INFO ] Flatten gal took : 86 ms
[2024-05-30 14:20:52] [INFO ] Flatten gal took : 40 ms
[2024-05-30 14:20:52] [INFO ] Input system was already deterministic with 809 transitions.
Support contains 109 out of 809 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2769 ms. (14 steps per ms) remains 18/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
[2024-05-30 14:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 592/621 variables, 62/62 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:20:53] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 8 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-30 14:20:54] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 20/82 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-30 14:20:55] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 2/84 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 188/809 variables, 19/103 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-30 14:20:56] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 6/109 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 809/1618 variables, 809/918 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1618 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/1618 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 918 constraints, problems are : Problem set: 1 solved, 17 unsolved in 4774 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 233/259 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 550/809 variables, 59/82 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 27/109 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:20:58] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:20:58] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:20:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-30 14:20:58] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-30 14:20:58] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-30 14:20:59] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-30 14:20:59] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-30 14:20:59] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-30 14:20:59] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 14:20:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 10/119 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 809/1618 variables, 809/928 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1618 variables, 17/945 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:21:00] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:21:01] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:21:01] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:21:01] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1618 variables, 9/954 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-30 14:21:01] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-30 14:21:01] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1618 variables, 2/956 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1618 variables, 0/956 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 956 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 49/49 constraints]
After SMT, in 9799ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 809/809 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 809 transition count 605
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 207 rules applied. Total rules applied 411 place count 605 transition count 602
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 418 place count 603 transition count 597
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 423 place count 598 transition count 597
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 141 Pre rules applied. Total rules applied 423 place count 598 transition count 456
Deduced a syphon composed of 141 places in 1 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 4 with 282 rules applied. Total rules applied 705 place count 457 transition count 456
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 723 place count 439 transition count 438
Iterating global reduction 4 with 18 rules applied. Total rules applied 741 place count 439 transition count 438
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 741 place count 439 transition count 427
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 763 place count 428 transition count 427
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 4 with 356 rules applied. Total rules applied 1119 place count 250 transition count 249
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1217 place count 201 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1218 place count 201 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1219 place count 200 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1220 place count 199 transition count 287
Applied a total of 1220 rules in 163 ms. Remains 199 /809 variables (removed 610) and now considering 287/809 (removed 522) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 199/809 places, 287/809 transitions.
RANDOM walk for 40000 steps (11 resets) in 761 ms. (52 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
// Phase 1: matrix 287 rows 199 cols
[2024-05-30 14:21:03] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:21:03] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/52 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 111/169 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 131/300 variables, 58/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 5/305 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/305 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 66/371 variables, 31/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/374 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/374 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 29/403 variables, 14/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/405 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/405 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 22/427 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/427 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/427 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 22/449 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/449 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/449 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 20/469 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/469 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/469 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 14/483 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/483 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/483 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 3/486 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/486 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/486 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/486 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 293 constraints, problems are : Problem set: 0 solved, 6 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 199/199 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/52 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 14:21:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 111/169 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 131/300 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 24/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 5/305 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/305 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 66/371 variables, 31/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 3/374 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 29/403 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/403 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/403 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 2/405 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/405 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 22/427 variables, 10/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/427 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/427 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 22/449 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/449 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/449 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 20/469 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/469 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/469 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 14/483 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/483 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/483 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 3/486 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/486 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/486 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 0/486 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 300 constraints, problems are : Problem set: 0 solved, 6 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 199/199 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1543ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 823 ms.
Support contains 12 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 287/287 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 286
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 198 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 197 transition count 285
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 place count 197 transition count 277
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 20 place count 189 transition count 277
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 185 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 181 transition count 280
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 181 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 180 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 180 transition count 278
Applied a total of 39 rules in 42 ms. Remains 180 /199 variables (removed 19) and now considering 278/287 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 180/199 places, 278/287 transitions.
RANDOM walk for 40000 steps (11 resets) in 280 ms. (142 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
// Phase 1: matrix 278 rows 180 cols
[2024-05-30 14:21:06] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:21:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 14:21:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/150 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 129/279 variables, 56/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/280 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 69/349 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/349 variables, 15/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 28/377 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/377 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/377 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 22/399 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/399 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/399 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 22/421 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/421 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/421 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 20/441 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/441 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/441 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 14/455 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/455 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/455 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 3/458 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/458 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/458 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 0/458 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 279 constraints, problems are : Problem set: 0 solved, 5 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 180/180 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/150 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 129/279 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 27/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/280 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/280 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 69/349 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/349 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 28/377 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/377 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/377 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 22/399 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/399 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/399 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 22/421 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/421 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/421 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 20/441 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/441 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/441 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 14/455 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/455 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/455 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 3/458 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/458 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/458 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 0/458 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 284 constraints, problems are : Problem set: 0 solved, 5 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 180/180 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 661 ms.
Support contains 11 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 278/278 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 179 transition count 277
Applied a total of 2 rules in 8 ms. Remains 179 /180 variables (removed 1) and now considering 277/278 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 179/180 places, 277/278 transitions.
RANDOM walk for 40000 steps (13 resets) in 284 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 226082 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 5
Probabilistic random walk after 226082 steps, saw 160521 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 277 rows 179 cols
[2024-05-30 14:21:11] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:21:11] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 101/150 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 128/278 variables, 56/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 28/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 69/347 variables, 30/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 28/375 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 22/397 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/397 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/397 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 22/419 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 20/439 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/439 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/439 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/453 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/453 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/453 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 3/456 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/456 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/456 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 0/456 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 277 constraints, problems are : Problem set: 0 solved, 5 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 179/179 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 14:21:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/150 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 128/278 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 28/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 69/347 variables, 30/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 28/375 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 22/397 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/397 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/397 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 22/419 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/419 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/419 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 20/439 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/439 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/439 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 14/453 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/453 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/453 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 3/456 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/456 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/456 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 0/456 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 283 constraints, problems are : Problem set: 0 solved, 5 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 179/179 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 352 ms.
Support contains 11 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 277/277 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 277/277 transitions.
Applied a total of 0 rules in 16 ms. Remains 179 /179 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-30 14:21:13] [INFO ] Invariant cache hit.
[2024-05-30 14:21:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 14:21:13] [INFO ] Invariant cache hit.
[2024-05-30 14:21:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 14:21:13] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-30 14:21:13] [INFO ] Redundant transitions in 13 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-30 14:21:13] [INFO ] Invariant cache hit.
[2024-05-30 14:21:13] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-30 14:21:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:21:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 277/456 variables, 179/261 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 18/279 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 279 constraints, problems are : Problem set: 0 solved, 271 unsolved in 8145 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 179/179 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 277/456 variables, 179/261 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 18/279 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 271/550 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 550 constraints, problems are : Problem set: 0 solved, 271 unsolved in 8613 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 179/179 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints]
After SMT, in 16837ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 16840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17155 ms. Remains : 179/179 places, 277/277 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 68 edges and 179 vertex of which 4 / 179 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 579 edges and 177 vertex of which 175 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 65 edges and 173 vertex of which 4 / 173 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 171 transition count 268
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 64 edges and 169 vertex of which 6 / 169 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 166 transition count 259
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 62 edges and 163 vertex of which 8 / 163 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 159 transition count 248
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 58 edges and 155 vertex of which 8 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 151 transition count 234
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 54 edges and 147 vertex of which 8 / 147 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 143 transition count 220
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 50 edges and 139 vertex of which 8 / 139 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 135 transition count 206
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 46 edges and 131 vertex of which 8 / 131 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 127 transition count 192
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 39 edges and 125 vertex of which 2 / 125 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 124 place count 124 transition count 182
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 128 place count 123 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 130 place count 122 transition count 178
Graph (complete) has 385 edges and 122 vertex of which 120 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 131 place count 120 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 135 place count 120 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 146 place count 120 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 148 place count 118 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 151 place count 116 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 155 place count 116 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 156 place count 116 transition count 157
Applied a total of 156 rules in 45 ms. Remains 116 /179 variables (removed 63) and now considering 157/277 (removed 120) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 157 rows 116 cols
[2024-05-30 14:21:30] [INFO ] Computed 49 invariants in 1 ms
[2024-05-30 14:21:30] [INFO ] [Real]Absence check using 49 positive place invariants in 5 ms returned sat
[2024-05-30 14:21:30] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-30 14:21:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 14:21:30] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 14:21:30] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 14:21:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 5 ms returned sat
[2024-05-30 14:21:30] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-30 14:21:30] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-30 14:21:30] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-30 14:21:30] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 435 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 14:21:30] [INFO ] Flatten gal took : 33 ms
[2024-05-30 14:21:30] [INFO ] Flatten gal took : 30 ms
[2024-05-30 14:21:30] [INFO ] Input system was already deterministic with 809 transitions.
Computed a total of 247 stabilizing places and 247 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 58 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 808 transition count 592
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 219 rules applied. Total rules applied 435 place count 592 transition count 589
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 442 place count 590 transition count 584
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 447 place count 585 transition count 584
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 447 place count 585 transition count 439
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 737 place count 440 transition count 439
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 755 place count 422 transition count 421
Iterating global reduction 4 with 18 rules applied. Total rules applied 773 place count 422 transition count 421
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 773 place count 422 transition count 409
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 797 place count 410 transition count 409
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 4 with 308 rules applied. Total rules applied 1105 place count 256 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1107 place count 254 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1108 place count 253 transition count 253
Applied a total of 1108 rules in 73 ms. Remains 253 /809 variables (removed 556) and now considering 253/809 (removed 556) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 253/809 places, 253/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 56 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 785/809 places, 785/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 789 transition count 789
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 789 transition count 789
Applied a total of 40 rules in 28 ms. Remains 789 /809 variables (removed 20) and now considering 789/809 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 789/809 places, 789/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 19 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 789 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 55 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 785/809 places, 785/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 19 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 785 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 54 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 786 transition count 786
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Applied a total of 50 rules in 66 ms. Remains 784 /809 variables (removed 25) and now considering 784/809 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 784/809 places, 784/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 18 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 18 ms
[2024-05-30 14:21:31] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 62 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:31] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 53 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 783 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 808 transition count 582
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 229 rules applied. Total rules applied 455 place count 582 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 457 place count 580 transition count 579
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 457 place count 580 transition count 433
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 749 place count 434 transition count 433
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 769 place count 414 transition count 413
Iterating global reduction 3 with 20 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 789 place count 414 transition count 399
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 817 place count 400 transition count 399
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 1129 place count 244 transition count 243
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 242 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1132 place count 241 transition count 241
Applied a total of 1132 rules in 50 ms. Remains 241 /809 variables (removed 568) and now considering 241/809 (removed 568) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 241/809 places, 241/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 241 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 784 transition count 784
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Applied a total of 54 rules in 53 ms. Remains 782 /809 variables (removed 27) and now considering 782/809 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 782/809 places, 782/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 782 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 52 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 75 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 808 transition count 581
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 230 rules applied. Total rules applied 457 place count 581 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 459 place count 579 transition count 578
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 459 place count 579 transition count 432
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 751 place count 433 transition count 432
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 770 place count 414 transition count 413
Iterating global reduction 3 with 19 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 789 place count 414 transition count 400
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 815 place count 401 transition count 400
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1131 place count 243 transition count 242
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 241 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1134 place count 240 transition count 240
Applied a total of 1134 rules in 52 ms. Remains 240 /809 variables (removed 569) and now considering 240/809 (removed 569) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 240/809 places, 240/809 transitions.
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:21:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:21:32] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (8 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15929 steps, run visited all 1 properties in 50 ms. (steps per millisecond=318 )
Probabilistic random walk after 15929 steps, saw 11614 distinct states, run finished after 54 ms. (steps per millisecond=294 ) properties seen :1
FORMULA ShieldRVt-PT-020B-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 63 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:21:33] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:21:33] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:33] [INFO ] Input system was already deterministic with 781 transitions.
[2024-05-30 14:21:33] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:33] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:21:33] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-30 14:21:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 809 places, 809 transitions and 1978 arcs took 4 ms.
Total runtime 102728 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-020B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 809
TRANSITIONS: 809
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.007s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 905
MODEL NAME: /home/mcc/execution/412/model
809 places, 809 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-020B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683760000986"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;