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

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717276337164

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:12:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:12:18] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 21:12:18] [INFO ] Transformed 1003 places.
[2024-06-01 21:12:18] [INFO ] Transformed 1003 transitions.
[2024-06-01 21:12:18] [INFO ] Found NUPN structural information;
[2024-06-01 21:12:18] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 209 places :
Symmetric choice reduction at 0 with 209 rule applications. Total rules 209 place count 794 transition count 794
Iterating global reduction 0 with 209 rules applied. Total rules applied 418 place count 794 transition count 794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 419 place count 793 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 420 place count 793 transition count 793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 421 place count 792 transition count 792
Iterating global reduction 0 with 1 rules applied. Total rules applied 422 place count 792 transition count 792
Applied a total of 422 rules in 246 ms. Remains 792 /1003 variables (removed 211) and now considering 792/1003 (removed 211) transitions.
// Phase 1: matrix 792 rows 792 cols
[2024-06-01 21:12:19] [INFO ] Computed 81 invariants in 27 ms
[2024-06-01 21:12:19] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 21:12:19] [INFO ] Invariant cache hit.
[2024-06-01 21:12:19] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Running 791 sub problems to find dead transitions.
[2024-06-01 21:12:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (OVERLAPS) 1/792 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-06-01 21:12:36] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 17 ms to minimize.
[2024-06-01 21:12:37] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:12:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:12:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 21:12:39] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:12:39] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:12:40] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:12:40] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:12:40] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
[2024-06-01 21:12:40] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:12:41] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:12:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:12:42] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:12:42] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:12:43] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:12:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:12:44] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:12:44] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 3 ms to minimize.
[2024-06-01 21:12:44] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:12:44] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-06-01 21:12:48] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2024-06-01 21:12:48] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:12:48] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 792/1584 variables, and 104 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 791 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (OVERLAPS) 1/792 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-06-01 21:13:04] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:13:05] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:13:05] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:13:06] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:13:06] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:13:06] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:13:06] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:13:07] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:13:07] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:13:07] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 5 (OVERLAPS) 792/1584 variables, 792/906 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1584 variables, 791/1697 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1584/1584 variables, and 1697 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 792/792 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 33/33 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 792/1003 places, 792/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61441 ms. Remains : 792/1003 places, 792/1003 transitions.
Support contains 18 out of 792 places after structural reductions.
[2024-06-01 21:13:20] [INFO ] Flatten gal took : 78 ms
[2024-06-01 21:13:20] [INFO ] Flatten gal took : 37 ms
[2024-06-01 21:13:20] [INFO ] Input system was already deterministic with 792 transitions.
Support contains 16 out of 792 places (down from 18) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 1337 ms. (29 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
[2024-06-01 21:13:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 696/792 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 792/1584 variables, 792/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1584 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1584 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1584/1584 variables, and 873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 792/792 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 696/792 variables, 75/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:13:21] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/792 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 792/1584 variables, 792/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1584 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 4 ms to minimize.
[2024-06-01 21:13:22] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 3 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 3 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:13:23] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:13:24] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1584 variables, 13/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1584 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1584 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1584/1584 variables, and 895 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2835 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 792/792 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 772 ms.
Support contains 6 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 792/792 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 792 transition count 579
Reduce places removed 213 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 214 rules applied. Total rules applied 427 place count 579 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 578 transition count 578
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 428 place count 578 transition count 424
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 736 place count 424 transition count 424
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 741 place count 419 transition count 419
Iterating global reduction 3 with 5 rules applied. Total rules applied 746 place count 419 transition count 419
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 746 place count 419 transition count 414
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 756 place count 414 transition count 414
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 1128 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1129 place count 228 transition count 227
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1131 place count 227 transition count 226
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1247 place count 169 transition count 279
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 1248 place count 169 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1249 place count 168 transition count 277
Applied a total of 1249 rules in 150 ms. Remains 168 /792 variables (removed 624) and now considering 277/792 (removed 515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 168/792 places, 277/792 transitions.
RANDOM walk for 40000 steps (29 resets) in 595 ms. (67 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
// Phase 1: matrix 277 rows 168 cols
[2024-06-01 21:13:25] [INFO ] Computed 81 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/70 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/136 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/200 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/267 variables, 24/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/269 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 68/337 variables, 26/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/337 variables, 11/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/337 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/338 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/338 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 52/390 variables, 22/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/390 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/390 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/391 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/391 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/391 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 24/415 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/415 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/415 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 19/434 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/434 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/434 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 11/445 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/445 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/445 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/445 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/70 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/136 variables, 24/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/200 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 67/267 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/269 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 68/337 variables, 26/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/337 variables, 11/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/337 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/338 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/338 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/338 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 52/390 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/390 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/390 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/391 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/391 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/391 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 24/415 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/415 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/415 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 19/434 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/434 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/434 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 11/445 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/445 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/445 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/445 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 250 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 277/277 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 168 transition count 275
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 165 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 162 transition count 277
Applied a total of 11 rules in 27 ms. Remains 162 /168 variables (removed 6) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 162/168 places, 277/277 transitions.
RANDOM walk for 40000 steps (11 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39104 steps (9 resets) in 86 ms. (449 steps per ms) remains 0/1 properties
Computed a total of 238 stabilizing places and 238 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&((F(p2) U p3)||p1)))))'
Support contains 5 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 785 transition count 785
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 785 transition count 785
Applied a total of 14 rules in 81 ms. Remains 785 /792 variables (removed 7) and now considering 785/792 (removed 7) transitions.
// Phase 1: matrix 785 rows 785 cols
[2024-06-01 21:13:26] [INFO ] Computed 81 invariants in 7 ms
[2024-06-01 21:13:26] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 21:13:26] [INFO ] Invariant cache hit.
[2024-06-01 21:13:26] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 21:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:13:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:13:44] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:13:44] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:13:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:13:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:13:46] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:13:46] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:13:47] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:13:47] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:13:48] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:13:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:13:49] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:13:50] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:13:50] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:13:50] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:13:50] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:13:51] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:13:51] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/1570 variables, and 101 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/785 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-06-01 21:14:08] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:14:13] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:14:13] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:14:13] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/785 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-06-01 21:14:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:14:23] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/785 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/1570 variables, and 107 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/785 constraints, PredecessorRefiner: 0/784 constraints, Known Traps: 26/26 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 785/792 places, 785/792 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 785/792 places, 785/792 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 303 ms.
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-020B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-020B-LTLCardinality-00 finished in 61839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 792 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 791 transition count 577
Reduce places removed 214 places and 0 transitions.
Iterating post reduction 1 with 214 rules applied. Total rules applied 428 place count 577 transition count 577
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 428 place count 577 transition count 422
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 738 place count 422 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 745 place count 415 transition count 415
Iterating global reduction 2 with 7 rules applied. Total rules applied 752 place count 415 transition count 415
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 752 place count 415 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 764 place count 409 transition count 409
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 0 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 1130 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 226 transition count 225
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 225 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1249 place count 167 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1251 place count 165 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1252 place count 164 transition count 276
Applied a total of 1252 rules in 93 ms. Remains 164 /792 variables (removed 628) and now considering 276/792 (removed 516) transitions.
// Phase 1: matrix 276 rows 164 cols
[2024-06-01 21:14:28] [INFO ] Computed 80 invariants in 1 ms
[2024-06-01 21:14:28] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 21:14:28] [INFO ] Invariant cache hit.
[2024-06-01 21:14:28] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-01 21:14:28] [INFO ] Redundant transitions in 11 ms returned []
Running 272 sub problems to find dead transitions.
[2024-06-01 21:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 275/439 variables, 164/244 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 0/439 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/440 variables, and 244 constraints, problems are : Problem set: 0 solved, 272 unsolved in 5682 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 275/439 variables, 164/244 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 272/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/440 variables, and 516 constraints, problems are : Problem set: 0 solved, 272 unsolved in 5626 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 11388ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 11392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/792 places, 276/792 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11768 ms. Remains : 164/792 places, 276/792 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLCardinality-02 finished in 11831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 791 transition count 578
Reduce places removed 213 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 214 rules applied. Total rules applied 427 place count 578 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 577 transition count 577
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 428 place count 577 transition count 421
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 740 place count 421 transition count 421
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 749 place count 412 transition count 412
Iterating global reduction 3 with 9 rules applied. Total rules applied 758 place count 412 transition count 412
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 758 place count 412 transition count 404
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 774 place count 404 transition count 404
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1130 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1131 place count 226 transition count 225
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1133 place count 225 transition count 224
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1251 place count 166 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1253 place count 164 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1254 place count 163 transition count 280
Applied a total of 1254 rules in 80 ms. Remains 163 /792 variables (removed 629) and now considering 280/792 (removed 512) transitions.
// Phase 1: matrix 280 rows 163 cols
[2024-06-01 21:14:39] [INFO ] Computed 80 invariants in 1 ms
[2024-06-01 21:14:40] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 21:14:40] [INFO ] Invariant cache hit.
[2024-06-01 21:14:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 21:14:40] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-06-01 21:14:40] [INFO ] Redundant transitions in 3 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-01 21:14:40] [INFO ] Invariant cache hit.
[2024-06-01 21:14:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 279/442 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/443 variables, and 251 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7086 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 279/442 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 275/526 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/443 variables, and 526 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7027 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints]
After SMT, in 14190ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 14193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/792 places, 280/792 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15026 ms. Remains : 163/792 places, 280/792 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-04
Stuttering criterion allowed to conclude after 288 steps with 0 reset in 4 ms.
FORMULA ShieldRVt-PT-020B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLCardinality-04 finished in 15081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 782 transition count 782
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 782 transition count 782
Applied a total of 20 rules in 29 ms. Remains 782 /792 variables (removed 10) and now considering 782/792 (removed 10) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-06-01 21:14:54] [INFO ] Computed 81 invariants in 8 ms
[2024-06-01 21:14:55] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 21:14:55] [INFO ] Invariant cache hit.
[2024-06-01 21:14:55] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-06-01 21:14:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:15:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:15:12] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 21:15:13] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:15:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:15:13] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:15:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:15:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:15:15] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:15:15] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:15:16] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:15:16] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:15:17] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:15:17] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:15:18] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:15:18] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:15:19] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:15:19] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:15:19] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:15:20] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:15:20] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:15:41] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/884 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1665 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:15:54] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 4 ms to minimize.
[2024-06-01 21:15:54] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 4 ms to minimize.
[2024-06-01 21:15:54] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 4 ms to minimize.
[2024-06-01 21:15:55] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 4 ms to minimize.
[2024-06-01 21:15:55] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 4 ms to minimize.
[2024-06-01 21:15:55] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 4 ms to minimize.
SMT process timed out in 60285ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LTL mode, iteration 1 : 782/792 places, 782/792 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 782/792 places, 782/792 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-020B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-020B-LTLCardinality-06 finished in 61508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 782 transition count 782
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 782 transition count 782
Applied a total of 20 rules in 25 ms. Remains 782 /792 variables (removed 10) and now considering 782/792 (removed 10) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-06-01 21:15:56] [INFO ] Computed 81 invariants in 3 ms
[2024-06-01 21:15:56] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 21:15:56] [INFO ] Invariant cache hit.
[2024-06-01 21:15:57] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-06-01 21:15:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:16:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:16:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:16:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:16:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:16:14] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:16:15] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:16:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:16:16] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 21:16:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:16:17] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:16:17] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:16:18] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:16:18] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-01 21:16:18] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 21:16:19] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:16:19] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:16:20] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:16:20] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:16:21] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:16:21] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
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 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:16:42] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/884 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1665 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-06-01 21:16:55] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 4 ms to minimize.
[2024-06-01 21:16:55] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 5 ms to minimize.
[2024-06-01 21:16:55] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 4 ms to minimize.
[2024-06-01 21:16:56] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 4 ms to minimize.
[2024-06-01 21:16:56] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2024-06-01 21:16:56] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/1564 variables, and 1671 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 27/27 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 782/792 places, 782/792 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 782/792 places, 782/792 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 262 ms.
Entered a terminal (fully accepting) state of product in 12833 steps with 1 reset in 43 ms.
FORMULA ShieldRVt-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLCardinality-07 finished in 61250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 792 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 792/792 places, 792/792 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 791 transition count 578
Reduce places removed 213 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 214 rules applied. Total rules applied 427 place count 578 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 577 transition count 577
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 428 place count 577 transition count 421
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 740 place count 421 transition count 421
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 748 place count 413 transition count 413
Iterating global reduction 3 with 8 rules applied. Total rules applied 756 place count 413 transition count 413
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 756 place count 413 transition count 406
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 770 place count 406 transition count 406
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 0 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 1132 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1133 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1135 place count 224 transition count 223
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1251 place count 166 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1253 place count 164 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1254 place count 163 transition count 278
Applied a total of 1254 rules in 62 ms. Remains 163 /792 variables (removed 629) and now considering 278/792 (removed 514) transitions.
// Phase 1: matrix 278 rows 163 cols
[2024-06-01 21:16:57] [INFO ] Computed 80 invariants in 1 ms
[2024-06-01 21:16:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 21:16:57] [INFO ] Invariant cache hit.
[2024-06-01 21:16:57] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-01 21:16:58] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 21:16:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 278/441 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 0/441 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 243 constraints, problems are : Problem set: 0 solved, 276 unsolved in 5774 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 278/441 variables, 163/243 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 276/519 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/441 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 519 constraints, problems are : Problem set: 0 solved, 276 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 11879ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 11883ms
Starting structural reductions in SI_LTL mode, iteration 1 : 163/792 places, 278/792 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12222 ms. Remains : 163/792 places, 278/792 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLCardinality-09
Stuttering criterion allowed to conclude after 11307 steps with 0 reset in 34 ms.
FORMULA ShieldRVt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLCardinality-09 finished in 12319 ms.
All properties solved by simple procedures.
Total runtime 291765 ms.
ITS solved all properties within timeout

BK_STOP 1717276630042

--------------------
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 LTLCardinality -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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762300987"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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