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-171683762200939.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-004B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762200939
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:39 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 11K Apr 11 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 21:29 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 48K 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-004B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-004B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717275276053

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-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:54:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:54:37] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 20:54:37] [INFO ] Transformed 203 places.
[2024-06-01 20:54:37] [INFO ] Transformed 203 transitions.
[2024-06-01 20:54:37] [INFO ] Found NUPN structural information;
[2024-06-01 20:54:37] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-004B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 173 transition count 173
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 173 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 172 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 172 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 171 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 171 transition count 171
Applied a total of 64 rules in 58 ms. Remains 171 /203 variables (removed 32) and now considering 171/203 (removed 32) transitions.
// Phase 1: matrix 171 rows 171 cols
[2024-06-01 20:54:37] [INFO ] Computed 17 invariants in 16 ms
[2024-06-01 20:54:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 20:54:37] [INFO ] Invariant cache hit.
[2024-06-01 20:54:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-06-01 20:54:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 10 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:43] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 171/342 variables, 171/210 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 210 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9160 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/342 variables, 171/210 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 170/380 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:50] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:54:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 9/398 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:53] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:54:53] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:54:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-01 20:54:55] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:54:55] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 403 constraints, problems are : Problem set: 0 solved, 170 unsolved in 14294 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 45/45 constraints]
After SMT, in 23508ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 23529ms
Starting structural reductions in LTL mode, iteration 1 : 171/203 places, 171/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23990 ms. Remains : 171/203 places, 171/203 transitions.
Support contains 39 out of 171 places after structural reductions.
[2024-06-01 20:55:01] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:55:01] [INFO ] Flatten gal took : 13 ms
[2024-06-01 20:55:01] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 37 out of 171 places (down from 39) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 22
RANDOM walk for 7066 steps (1 resets) in 308 ms. (22 steps per ms) remains 0/22 properties
FORMULA ShieldRVt-PT-004B-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldRVt-PT-004B-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 50 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' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 170 transition count 126
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 126 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 125 transition count 125
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 90 place count 125 transition count 100
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 140 place count 100 transition count 100
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 147 place count 93 transition count 93
Iterating global reduction 3 with 7 rules applied. Total rules applied 154 place count 93 transition count 93
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 154 place count 93 transition count 87
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 166 place count 87 transition count 87
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 234 place count 53 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 235 place count 53 transition count 52
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 237 place count 52 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 259 place count 41 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 39 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 38 transition count 59
Applied a total of 262 rules in 40 ms. Remains 38 /171 variables (removed 133) and now considering 59/171 (removed 112) transitions.
// Phase 1: matrix 59 rows 38 cols
[2024-06-01 20:55:02] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 20:55:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 20:55:02] [INFO ] Invariant cache hit.
[2024-06-01 20:55:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 20:55:02] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-06-01 20:55:02] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 20:55:02] [INFO ] Invariant cache hit.
[2024-06-01 20:55:02] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 20:55:02] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 20:55:02] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 58/96 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 71 constraints, problems are : Problem set: 0 solved, 53 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 58/96 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 53/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 124 constraints, problems are : Problem set: 0 solved, 53 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 2/2 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/171 places, 59/171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1485 ms. Remains : 38/171 places, 59/171 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-00
Product exploration explored 100000 steps with 89 reset in 423 ms.
Product exploration explored 100000 steps with 93 reset in 228 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/38 stabilizing places and 4/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (41 resets) in 418 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2024-06-01 20:55:05] [INFO ] Invariant cache hit.
[2024-06-01 20:55:05] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/81 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/96 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/96 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/81 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/96 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/96 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/96 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 59/59 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 58
Applied a total of 1 rules in 7 ms. Remains 38 /38 variables (removed 0) and now considering 58/59 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 38/38 places, 58/59 transitions.
RANDOM walk for 40000 steps (43 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Probably explored full state space saw : 220385 states, properties seen :0
Probabilistic random walk after 2027809 steps, saw 220385 distinct states, run finished after 2091 ms. (steps per millisecond=969 ) properties seen :0
Explored full state space saw : 220481 states, properties seen :0
Exhaustive walk after 2028517 steps, saw 220481 distinct states, run finished after 1830 ms. (steps per millisecond=1108 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLCardinality-00 finished in 7056 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(F(p0)))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 157 transition count 157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 157 transition count 157
Applied a total of 28 rules in 13 ms. Remains 157 /171 variables (removed 14) and now considering 157/171 (removed 14) transitions.
// Phase 1: matrix 157 rows 157 cols
[2024-06-01 20:55:09] [INFO ] Computed 17 invariants in 7 ms
[2024-06-01 20:55:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 20:55:09] [INFO ] Invariant cache hit.
[2024-06-01 20:55:09] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 20:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:10] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:55:10] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:55:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 5 ms to minimize.
[2024-06-01 20:55:11] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 179 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4650 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 156/335 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:55:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:25] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:55:25] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:25] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/314 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:27] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 21990 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 26674ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 26676ms
Starting structural reductions in LTL mode, iteration 1 : 157/171 places, 157/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26932 ms. Remains : 157/171 places, 157/171 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-01
Product exploration explored 100000 steps with 2206 reset in 238 ms.
Product exploration explored 100000 steps with 2222 reset in 157 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/157 stabilizing places and 46/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 20:55:37] [INFO ] Invariant cache hit.
[2024-06-01 20:55:37] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-06-01 20:55:37] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 20:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:55:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-06-01 20:55:37] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 20:55:37] [INFO ] Computed and/alt/rep : 156/229/156 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 20:55:38] [INFO ] Added : 154 causal constraints over 31 iterations in 669 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 156 transition count 114
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 114 transition count 114
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 84 place count 114 transition count 82
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 148 place count 82 transition count 82
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 214 place count 49 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 49 transition count 48
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 217 place count 48 transition count 47
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 239 place count 37 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 35 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 34 transition count 55
Applied a total of 242 rules in 29 ms. Remains 34 /157 variables (removed 123) and now considering 55/157 (removed 102) transitions.
// Phase 1: matrix 55 rows 34 cols
[2024-06-01 20:55:38] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 20:55:38] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 20:55:38] [INFO ] Invariant cache hit.
[2024-06-01 20:55:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 20:55:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-01 20:55:38] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 20:55:38] [INFO ] Invariant cache hit.
[2024-06-01 20:55:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/88 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 54 constraints, problems are : Problem set: 0 solved, 50 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/88 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 104 constraints, problems are : Problem set: 0 solved, 50 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1180ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/157 places, 55/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1529 ms. Remains : 34/157 places, 55/157 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/34 stabilizing places and 2/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 20:55:40] [INFO ] Invariant cache hit.
[2024-06-01 20:55:40] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-06-01 20:55:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 20:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:55:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-06-01 20:55:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 20:55:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 20:55:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-06-01 20:55:40] [INFO ] Computed and/alt/rep : 50/177/50 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 20:55:40] [INFO ] Added : 32 causal constraints over 7 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-01 finished in 31377 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 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 158 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 158 transition count 158
Applied a total of 26 rules in 6 ms. Remains 158 /171 variables (removed 13) and now considering 158/171 (removed 13) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-06-01 20:55:40] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 20:55:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 20:55:40] [INFO ] Invariant cache hit.
[2024-06-01 20:55:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-06-01 20:55:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:55:41] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/181 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 181 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4485 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/181 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/338 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:55:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:55:46] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:55:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:55:46] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 16/354 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:55:49] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:55:49] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:55:50] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:55:52] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:55:52] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:55:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 365 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12400 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 33/33 constraints]
After SMT, in 16931ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 16933ms
Starting structural reductions in LTL mode, iteration 1 : 158/171 places, 158/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17094 ms. Remains : 158/171 places, 158/171 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, p0, p0, (AND p0 p1), p1]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-03 finished in 17266 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 170 transition count 126
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 126 transition count 126
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 88 place count 126 transition count 101
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 138 place count 101 transition count 101
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 148 place count 91 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 158 place count 91 transition count 91
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 158 place count 91 transition count 83
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 174 place count 83 transition count 83
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 240 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 50 transition count 49
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 243 place count 49 transition count 48
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 263 place count 39 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 39 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 37 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 36 transition count 54
Applied a total of 267 rules in 28 ms. Remains 36 /171 variables (removed 135) and now considering 54/171 (removed 117) transitions.
// Phase 1: matrix 54 rows 36 cols
[2024-06-01 20:55:57] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 20:55:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 20:55:58] [INFO ] Invariant cache hit.
[2024-06-01 20:55:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-01 20:55:58] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 20:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 53/89 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 0/89 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 52 constraints, problems are : Problem set: 0 solved, 50 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 53/89 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 50/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/89 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 102 constraints, problems are : Problem set: 0 solved, 50 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/171 places, 54/171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 958 ms. Remains : 36/171 places, 54/171 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-06
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-06 finished in 1021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||(p2&&G(p3))||p0))))'
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 160 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 160 transition count 160
Applied a total of 22 rules in 7 ms. Remains 160 /171 variables (removed 11) and now considering 160/171 (removed 11) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-06-01 20:55:58] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 20:55:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 20:55:59] [INFO ] Invariant cache hit.
[2024-06-01 20:55:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-01 20:55:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:56:00] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:56:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:56:00] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:56:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/320 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 183 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5964 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:56:05] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 160/320 variables, 160/186 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 159/345 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:07] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 19/364 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 10 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 11/375 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:12] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:56:12] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:56:12] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:14] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:56:15] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:16] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:56:17] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:19] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 385 constraints, problems are : Problem set: 0 solved, 159 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 49/49 constraints]
After SMT, in 26036ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 26038ms
Starting structural reductions in LTL mode, iteration 1 : 160/171 places, 160/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26193 ms. Remains : 160/171 places, 160/171 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 362 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-08 finished in 26390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0) U p0))&&X(G(F(p1))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 159 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 159 transition count 159
Applied a total of 24 rules in 2 ms. Remains 159 /171 variables (removed 12) and now considering 159/171 (removed 12) transitions.
// Phase 1: matrix 159 rows 159 cols
[2024-06-01 20:56:25] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 20:56:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 20:56:25] [INFO ] Invariant cache hit.
[2024-06-01 20:56:25] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 20:56:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:56:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:56:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:56:27] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 184 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4593 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 158/342 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 3 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:56:32] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:33] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:56:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:56:34] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:56:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:56:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:34] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:56:35] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:56:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:35] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 10/369 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:40] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:56:41] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:44] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:56:44] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/318 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:46] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:46] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:56:48] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 381 constraints, problems are : Problem set: 0 solved, 158 unsolved in 24447 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 47/47 constraints]
After SMT, in 29088ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 29090ms
Starting structural reductions in LTL mode, iteration 1 : 159/171 places, 159/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29259 ms. Remains : 159/171 places, 159/171 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-09 finished in 29443 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(F((G((p1||X(p1)))||G(p2)||p0))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 158 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 158 transition count 158
Applied a total of 26 rules in 2 ms. Remains 158 /171 variables (removed 13) and now considering 158/171 (removed 13) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-06-01 20:56:54] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:56:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 20:56:54] [INFO ] Invariant cache hit.
[2024-06-01 20:56:54] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-06-01 20:56:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:56:55] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4576 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:57:00] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 17/354 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:04] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 9/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:05] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:05] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:05] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:05] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:57:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
[2024-06-01 20:57:07] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:08] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
[2024-06-01 20:57:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:57:09] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:09] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/316 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:57:13] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (OVERLAPS) 0/316 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 376 constraints, problems are : Problem set: 0 solved, 157 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 44/44 constraints]
After SMT, in 24627ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 24631ms
Starting structural reductions in LTL mode, iteration 1 : 158/171 places, 158/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24797 ms. Remains : 158/171 places, 158/171 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/158 stabilizing places and 46/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 44 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLCardinality-10 finished in 25208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1&&X(p2))||p0)))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 159 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 159 transition count 159
Applied a total of 24 rules in 2 ms. Remains 159 /171 variables (removed 12) and now considering 159/171 (removed 12) transitions.
// Phase 1: matrix 159 rows 159 cols
[2024-06-01 20:57:20] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:57:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 20:57:20] [INFO ] Invariant cache hit.
[2024-06-01 20:57:20] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 20:57:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:57:21] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 184 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4457 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 158/342 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 17/359 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:57:28] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:57:29] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 10/369 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:33] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:33] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:57:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:39] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:57:39] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/318 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:40] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-06-01 20:57:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:40] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 20:57:43] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 381 constraints, problems are : Problem set: 0 solved, 158 unsolved in 24163 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 47/47 constraints]
After SMT, in 28649ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 28651ms
Starting structural reductions in LTL mode, iteration 1 : 159/171 places, 159/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28921 ms. Remains : 159/171 places, 159/171 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-13 finished in 29033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 160 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 160 transition count 160
Applied a total of 22 rules in 2 ms. Remains 160 /171 variables (removed 11) and now considering 160/171 (removed 11) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-06-01 20:57:49] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:57:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 20:57:49] [INFO ] Invariant cache hit.
[2024-06-01 20:57:49] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-01 20:57:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/320 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4939 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:57:54] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/320 variables, 160/185 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 159/344 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:57:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:55] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:57:57] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:58:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:58:01] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 5/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:58:04] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/320 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 378 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15524 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 42/42 constraints]
After SMT, in 20492ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 20493ms
Starting structural reductions in LTL mode, iteration 1 : 160/171 places, 160/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20630 ms. Remains : 160/171 places, 160/171 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLCardinality-14
Stuttering criterion allowed to conclude after 1418 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-004B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLCardinality-14 finished in 20787 ms.
All properties solved by simple procedures.
Total runtime 212605 ms.
ITS solved all properties within timeout

BK_STOP 1717275489887

--------------------
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-004B"
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-004B, 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-171683762200939"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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