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-171683760500188.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 ShieldIIPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 20:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 17K 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 ShieldIIPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717235194202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:46:35] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-06-01 09:46:35] [INFO ] Transformed 73 places.
[2024-06-01 09:46:35] [INFO ] Transformed 68 transitions.
[2024-06-01 09:46:35] [INFO ] Found NUPN structural information;
[2024-06-01 09:46:35] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPt-PT-001B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 64
Applied a total of 8 rules in 21 ms. Remains 69 /73 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 69 cols
[2024-06-01 09:46:35] [INFO ] Computed 10 invariants in 10 ms
[2024-06-01 09:46:35] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 09:46:35] [INFO ] Invariant cache hit.
[2024-06-01 09:46:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-06-01 09:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 17 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/133 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 87 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/133 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 63/150 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:46:39] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:46:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/133 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 159 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 17/17 constraints]
After SMT, in 4931ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4945ms
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 64/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5280 ms. Remains : 69/73 places, 64/68 transitions.
Support contains 26 out of 69 places after structural reductions.
[2024-06-01 09:46:41] [INFO ] Flatten gal took : 23 ms
[2024-06-01 09:46:41] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:46:41] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 24 out of 69 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 839 ms. (47 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
[2024-06-01 09:46:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 69/133 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ShieldIIPt-PT-001B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Applied a total of 16 rules in 8 ms. Remains 61 /69 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-06-01 09:46:41] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 09:46:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:46:41] [INFO ] Invariant cache hit.
[2024-06-01 09:46:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 09:46:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 80 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 55/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:46:43] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 15/15 constraints]
After SMT, in 2539ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2541ms
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 56/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2652 ms. Remains : 61/69 places, 56/64 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-00 finished in 2911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 68 transition count 46
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 51 transition count 44
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 49 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 49 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 44 transition count 38
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 41 transition count 35
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 41 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 41 transition count 34
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 57 place count 40 transition count 34
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 89 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 22 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 20 transition count 18
Applied a total of 95 rules in 25 ms. Remains 20 /69 variables (removed 49) and now considering 18/64 (removed 46) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 09:46:44] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 09:46:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 09:46:44] [INFO ] Invariant cache hit.
[2024-06-01 09:46:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 09:46:44] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 09:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 17/37 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 17/37 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/37 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 43 constraints, problems are : Problem set: 0 solved, 14 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/69 places, 18/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 20/69 places, 18/64 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-01 finished in 368 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(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Applied a total of 16 rules in 17 ms. Remains 61 /69 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-06-01 09:46:45] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:46:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 09:46:45] [INFO ] Invariant cache hit.
[2024-06-01 09:46:45] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 09:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 4 ms to minimize.
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/117 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 78 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 55/133 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
[2024-06-01 09:46:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:46:46] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:46:47] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 137 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 11/11 constraints]
After SMT, in 2564ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2565ms
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 56/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2667 ms. Remains : 61/69 places, 56/64 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 130 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-05 finished in 2779 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&&(F(p1) U G(p2))))))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 59
Applied a total of 10 rules in 7 ms. Remains 64 /69 variables (removed 5) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-06-01 09:46:47] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:46:47] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 09:46:47] [INFO ] Invariant cache hit.
[2024-06-01 09:46:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 09:46:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 09:46:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 81 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:46:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 09:46:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 146 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints]
After SMT, in 2868ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2870ms
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 59/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2971 ms. Remains : 64/69 places, 59/64 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-06
Product exploration explored 100000 steps with 534 reset in 213 ms.
Stack based approach found an accepted trace after 619 steps with 3 reset with depth 216 and stack size 209 in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-06 finished in 3433 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))||G(p1)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 57
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 55
Applied a total of 18 rules in 11 ms. Remains 60 /69 variables (removed 9) and now considering 55/64 (removed 9) transitions.
// Phase 1: matrix 55 rows 60 cols
[2024-06-01 09:46:51] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:46:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 09:46:51] [INFO ] Invariant cache hit.
[2024-06-01 09:46:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 09:46:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:52] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:46:52] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:46:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:53] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/115 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 3526ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3527ms
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 55/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3616 ms. Remains : 60/69 places, 55/64 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-07
Product exploration explored 100000 steps with 3597 reset in 205 ms.
Product exploration explored 100000 steps with 3609 reset in 241 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 394 steps (0 resets) in 13 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 59 transition count 46
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 51 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 50 transition count 45
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 18 place count 50 transition count 37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 34 place count 42 transition count 37
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 68 place count 25 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 25 transition count 19
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 71 place count 24 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 21 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 74 place count 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 20 transition count 16
Applied a total of 76 rules in 11 ms. Remains 20 /60 variables (removed 40) and now considering 16/55 (removed 39) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-06-01 09:46:56] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:46:56] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/60 places, 16/55 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 15
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 18 cols
[2024-06-01 09:46:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 09:46:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 09:46:56] [INFO ] Invariant cache hit.
[2024-06-01 09:46:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/60 places, 15/55 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 18/60 places, 15/55 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
RANDOM walk for 65 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 592 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 25094 reset in 69 ms.
Product exploration explored 100000 steps with 25068 reset in 97 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-06-01 09:46:58] [INFO ] Invariant cache hit.
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 09:46:59] [INFO ] Invariant cache hit.
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 09:46:59] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 09:46:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 18/18 places, 15/15 transitions.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-07 finished in 8176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 68 transition count 46
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 51 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 50 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 50 transition count 38
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 49 place count 44 transition count 38
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 41 transition count 35
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 41 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 41 transition count 34
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 57 place count 40 transition count 34
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 89 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 22 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 21 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 19 transition count 17
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 98 place count 18 transition count 17
Applied a total of 98 rules in 11 ms. Remains 18 /69 variables (removed 51) and now considering 17/64 (removed 47) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-06-01 09:46:59] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/69 places, 17/64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 16
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-06-01 09:46:59] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 09:46:59] [INFO ] Invariant cache hit.
[2024-06-01 09:46:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/69 places, 16/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 16/69 places, 16/64 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 40 ms.
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/16 stabilizing places and 2/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-001B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-001B-LTLFireability-09 finished in 265 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 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 68 transition count 45
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 50 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 49 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 49 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 44 transition count 38
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 41 transition count 35
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 41 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 55 place count 41 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 39 transition count 33
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 24 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 91 place count 23 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 22 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 20 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 94 place count 20 transition count 16
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 96 place count 19 transition count 16
Applied a total of 96 rules in 8 ms. Remains 19 /69 variables (removed 50) and now considering 16/64 (removed 48) transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-06-01 09:46:59] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/69 places, 16/64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 15
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 17 cols
[2024-06-01 09:46:59] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:46:59] [INFO ] Invariant cache hit.
[2024-06-01 09:46:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/69 places, 15/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 17/69 places, 15/64 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-11
Stuttering criterion allowed to conclude after 5129 steps with 0 reset in 10 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-11 finished in 183 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(p0)))'
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Applied a total of 16 rules in 5 ms. Remains 61 /69 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 61 cols
[2024-06-01 09:46:59] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 09:47:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 09:47:00] [INFO ] Invariant cache hit.
[2024-06-01 09:47:00] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 09:47:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:47:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 79 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 56/117 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 55/134 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 09:47:03] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/117 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 15/15 constraints]
After SMT, in 3989ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3990ms
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 56/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4280 ms. Remains : 61/69 places, 56/64 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-12 finished in 4372 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 p1) U (p2&&X(p2)))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 57
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 55
Applied a total of 18 rules in 3 ms. Remains 60 /69 variables (removed 9) and now considering 55/64 (removed 9) transitions.
// Phase 1: matrix 55 rows 60 cols
[2024-06-01 09:47:04] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 09:47:04] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 09:47:04] [INFO ] Invariant cache hit.
[2024-06-01 09:47:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 09:47:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:47:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:47:04] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:47:04] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:47:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:05] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:47:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:47:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/115 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2511 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 3748ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3748ms
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 55/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4041 ms. Remains : 60/69 places, 55/64 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-13 finished in 4296 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(!p0)) U G((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 57
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 55
Applied a total of 18 rules in 3 ms. Remains 60 /69 variables (removed 9) and now considering 55/64 (removed 9) transitions.
[2024-06-01 09:47:08] [INFO ] Invariant cache hit.
[2024-06-01 09:47:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 09:47:08] [INFO ] Invariant cache hit.
[2024-06-01 09:47:08] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 09:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/115 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:47:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:47:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:11] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:11] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/115 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 09:47:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 13/13 constraints]
After SMT, in 3890ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3891ms
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 55/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4029 ms. Remains : 60/69 places, 55/64 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-14
Product exploration explored 100000 steps with 4 reset in 134 ms.
Stack based approach found an accepted trace after 364 steps with 0 reset with depth 365 and stack size 345 in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-14 finished in 4512 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 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 68 transition count 46
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 51 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 50 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 49 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 39 place count 49 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 49 place count 44 transition count 38
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 54 place count 39 transition count 33
Iterating global reduction 4 with 5 rules applied. Total rules applied 59 place count 39 transition count 33
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 59 place count 39 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 63 place count 37 transition count 31
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 87 place count 25 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 23 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 22 transition count 19
Applied a total of 92 rules in 11 ms. Remains 22 /69 variables (removed 47) and now considering 19/64 (removed 45) transitions.
// Phase 1: matrix 19 rows 22 cols
[2024-06-01 09:47:13] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants in 59 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/69 places, 19/64 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Applied a total of 2 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 09:47:13] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants in 185 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/69 places, 18/64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 17
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-06-01 09:47:13] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:47:13] [INFO ] Invariant cache hit.
[2024-06-01 09:47:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 18/69 places, 17/64 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 328 ms. Remains : 18/69 places, 17/64 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-15
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-15 finished in 380 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))||G(p1)))'
Found a Shortening insensitive property : ShieldIIPt-PT-001B-LTLFireability-07
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 69/69 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 68 transition count 47
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 52 transition count 45
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 51 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 50 transition count 44
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 37 place count 50 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 45 place count 46 transition count 40
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 49 place count 42 transition count 36
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 42 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 53 place count 42 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 40 transition count 34
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 89 place count 24 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 21 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 20 transition count 16
Applied a total of 94 rules in 18 ms. Remains 20 /69 variables (removed 49) and now considering 16/64 (removed 48) transitions.
// Phase 1: matrix 16 rows 20 cols
[2024-06-01 09:47:13] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants in 50 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/69 places, 16/64 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 15
Applied a total of 2 rules in 2 ms. Remains 18 /19 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 18 cols
[2024-06-01 09:47:13] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 09:47:13] [INFO ] Invariant cache hit.
[2024-06-01 09:47:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 18/69 places, 15/64 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 192 ms. Remains : 18/69 places, 15/64 transitions.
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-07
Product exploration explored 100000 steps with 25085 reset in 66 ms.
Product exploration explored 100000 steps with 25214 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 406 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-06-01 09:47:15] [INFO ] Invariant cache hit.
[2024-06-01 09:47:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:47:15] [INFO ] Invariant cache hit.
[2024-06-01 09:47:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 09:47:15] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 09:47:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 18/18 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 311 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
RANDOM walk for 139 steps (0 resets) in 10 ms. (12 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 25031 reset in 71 ms.
Product exploration explored 100000 steps with 25097 reset in 69 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-06-01 09:47:17] [INFO ] Invariant cache hit.
[2024-06-01 09:47:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 09:47:17] [INFO ] Invariant cache hit.
[2024-06-01 09:47:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 09:47:17] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 09:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 15/33 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 18/18 places, 15/15 transitions.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-07 finished in 4575 ms.
[2024-06-01 09:47:18] [INFO ] Flatten gal took : 5 ms
[2024-06-01 09:47:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 09:47:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 64 transitions and 160 arcs took 1 ms.
Total runtime 42755 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPt-PT-001B-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717235238555

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPt-PT-001B-LTLFireability-07
ltl formula formula --ltl=/tmp/1801/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 69 places, 64 transitions and 160 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1801/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 71 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 70, there are 75 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~48 levels ~10000 states ~25100 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6989
pnml2lts-mc( 0/ 4): unique states count: 6989
pnml2lts-mc( 0/ 4): unique transitions count: 23213
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16360
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7152
pnml2lts-mc( 0/ 4): - cum. max stack depth: 176
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7152 states 23931 transitions, fanout: 3.346
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.070 sec minimum, 0.075 sec on average)
pnml2lts-mc( 0/ 4): States per second: 89400, Transitions per second: 299138
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.0 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 64 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="ShieldIIPt-PT-001B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPt-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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