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-171683760900364.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 ShieldPPPs-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-171683760900364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 11:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 11:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 11:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 18K 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 ShieldPPPs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717241745202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:35:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:35:46] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-06-01 11:35:46] [INFO ] Transformed 71 places.
[2024-06-01 11:35:46] [INFO ] Transformed 66 transitions.
[2024-06-01 11:35:46] [INFO ] Found NUPN structural information;
[2024-06-01 11:35:46] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-001B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 65
Applied a total of 2 rules in 19 ms. Remains 70 /71 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 70 cols
[2024-06-01 11:35:46] [INFO ] Computed 12 invariants in 18 ms
[2024-06-01 11:35:46] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 11:35:46] [INFO ] Invariant cache hit.
[2024-06-01 11:35:46] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 11:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 9 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/135 variables, 70/104 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:35:48] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 106 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 65/135 variables, 70/107 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 64/171 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:50] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:35:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:35:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:35:50] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/135 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:35:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 177 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3773 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints]
After SMT, in 6308ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6321ms
Starting structural reductions in LTL mode, iteration 1 : 70/71 places, 65/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6635 ms. Remains : 70/71 places, 65/66 transitions.
Support contains 38 out of 70 places after structural reductions.
[2024-06-01 11:35:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 11:35:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:35:53] [INFO ] Input system was already deterministic with 65 transitions.
Support contains 37 out of 70 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (131 resets) in 678 ms. (58 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40003 steps (64 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
[2024-06-01 11:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 67/135 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, State Equation: 0/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ShieldPPPs-PT-001B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPs-PT-001B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA ShieldPPPs-PT-001B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||F(p2)||G(!p0)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 4 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-06-01 11:35:54] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 11:35:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
[2024-06-01 11:35:54] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:35:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3557ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3558ms
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3654 ms. Remains : 63/70 places, 58/65 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-00
Product exploration explored 100000 steps with 12606 reset in 152 ms.
Product exploration explored 100000 steps with 12387 reset in 123 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/63 stabilizing places and 11/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 237 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 12 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:35:59] [INFO ] Invariant cache hit.
[2024-06-01 11:35:59] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:35:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 11:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:35:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:35:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 11:35:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:35:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:35:59] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:35:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2024-06-01 11:35:59] [INFO ] Computed and/alt/rep : 57/101/57 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 11:35:59] [INFO ] Added : 45 causal constraints over 9 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 58/58 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 62 transition count 49
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 54 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 54 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 49 transition count 44
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 34 transition count 29
Applied a total of 55 rules in 15 ms. Remains 34 /63 variables (removed 29) and now considering 29/58 (removed 29) transitions.
// Phase 1: matrix 29 rows 34 cols
[2024-06-01 11:35:59] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 11:35:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:35:59] [INFO ] Invariant cache hit.
[2024-06-01 11:35:59] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 11:35:59] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 11:35:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-01 11:35:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:35:59] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/63 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/63 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 76 constraints, problems are : Problem set: 0 solved, 28 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/63 places, 29/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 34/63 places, 29/58 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/34 stabilizing places and 2/29 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-00 finished in 6194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 6 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-06-01 11:36:00] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 11:36:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 11:36:00] [INFO ] Invariant cache hit.
[2024-06-01 11:36:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 11:36:00] [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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:00] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:01] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:01] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:01] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 59/123 variables, 64/88 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:01] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:02] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/123 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 90 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:36:03] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:36:03] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/123 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:03] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/123 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/123 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:05] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:36:05] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (OVERLAPS) 0/123 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 156 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3913 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 22/22 constraints]
After SMT, in 5917ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5918ms
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6014 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-01
Product exploration explored 100000 steps with 15025 reset in 124 ms.
Product exploration explored 100000 steps with 14886 reset in 96 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/64 stabilizing places and 12/59 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:36:07] [INFO ] Invariant cache hit.
[2024-06-01 11:36:07] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 11:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-06-01 11:36:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 11:36:07] [INFO ] Computed and/alt/rep : 58/102/58 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 11:36:07] [INFO ] Added : 56 causal constraints over 12 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 59/59 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 63 transition count 50
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 55 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 55 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 50 transition count 45
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 2 with 32 rules applied. Total rules applied 58 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 33 transition count 28
Applied a total of 59 rules in 12 ms. Remains 33 /64 variables (removed 31) and now considering 28/59 (removed 31) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-06-01 11:36:07] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:36:07] [INFO ] Invariant cache hit.
[2024-06-01 11:36:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 11:36:07] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 11:36:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/64 places, 28/59 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 584 ms. Remains : 33/64 places, 28/59 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:36:08] [INFO ] Invariant cache hit.
[2024-06-01 11:36:08] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 11:36:08] [INFO ] Computed and/alt/rep : 26/48/26 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 11:36:08] [INFO ] Added : 23 causal constraints over 5 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33378 reset in 66 ms.
Product exploration explored 100000 steps with 33430 reset in 64 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 11:36:08] [INFO ] Invariant cache hit.
[2024-06-01 11:36:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:36:09] [INFO ] Invariant cache hit.
[2024-06-01 11:36:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 11:36:09] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 11:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 484ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 33/33 places, 28/28 transitions.
Treatment of property ShieldPPPs-PT-001B-LTLFireability-01 finished in 9193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 57
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16 place count 61 transition count 51
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 26 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 33 place count 49 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 46 transition count 41
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 3 with 24 rules applied. Total rules applied 70 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 33 transition count 28
Applied a total of 71 rules in 9 ms. Remains 33 /70 variables (removed 37) and now considering 28/65 (removed 37) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-06-01 11:36:09] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 11:36:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 11:36:09] [INFO ] Invariant cache hit.
[2024-06-01 11:36:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 11:36:09] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-06-01 11:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 11:36:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:36:09] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 11:36:09] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 48 constraints, problems are : Problem set: 0 solved, 27 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/61 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 77 constraints, problems are : Problem set: 0 solved, 27 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints]
After SMT, in 739ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 739ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/70 places, 28/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 33/70 places, 28/65 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-03
Stuttering criterion allowed to conclude after 644 steps with 38 reset in 2 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-03 finished in 980 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 U p1)||G(F(p2))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 9 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-06-01 11:36:10] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 11:36:10] [INFO ] Invariant cache hit.
[2024-06-01 11:36:10] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 11:36:10] [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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:36:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:36:11] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:36:11] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 59/123 variables, 64/87 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 58/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:36:12] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 150 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 16/16 constraints]
After SMT, in 3032ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3032ms
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3116 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-04
Stuttering criterion allowed to conclude after 2772 steps with 246 reset in 6 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-04 finished in 3260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 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 69 transition count 56
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 56 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 51 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 51 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 49 transition count 44
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 2 with 24 rules applied. Total rules applied 64 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 36 transition count 31
Applied a total of 65 rules in 17 ms. Remains 36 /70 variables (removed 34) and now considering 31/65 (removed 34) transitions.
// Phase 1: matrix 31 rows 36 cols
[2024-06-01 11:36:13] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 11:36:13] [INFO ] Invariant cache hit.
[2024-06-01 11:36:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 11:36:13] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 11:36:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-01 11:36:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/67 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 49 constraints, problems are : Problem set: 0 solved, 30 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/67 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 30/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 79 constraints, problems are : Problem set: 0 solved, 30 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/70 places, 31/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 36/70 places, 31/65 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-05
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-05 finished in 821 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 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 62 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 40 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 46 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 72 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 32 transition count 27
Applied a total of 73 rules in 13 ms. Remains 32 /70 variables (removed 38) and now considering 27/65 (removed 38) transitions.
// Phase 1: matrix 27 rows 32 cols
[2024-06-01 11:36:14] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 11:36:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:36:14] [INFO ] Invariant cache hit.
[2024-06-01 11:36:14] [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.
[2024-06-01 11:36:14] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 11:36:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 11:36:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 45 constraints, problems are : Problem set: 0 solved, 24 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 69 constraints, problems are : Problem set: 0 solved, 24 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/70 places, 27/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 32/70 places, 27/65 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-06
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-06 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(G(p1)&&F(G(p2))))))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 8 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-06-01 11:36:15] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 11:36:15] [INFO ] Invariant cache hit.
[2024-06-01 11:36:15] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 11:36:15] [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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:36:15] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:36:15] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:36:15] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 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, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/140 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:36:16] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:17] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 11:36:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:36:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 154 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 20/20 constraints]
After SMT, in 3906ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3907ms
Starting structural reductions in LTL mode, iteration 1 : 64/70 places, 59/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3993 ms. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-07 finished in 4367 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)||G(p1))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 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 69 transition count 56
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 61 transition count 56
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 61 transition count 52
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 57 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 52 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 52 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 52 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 50 transition count 45
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 35 transition count 30
Applied a total of 67 rules in 16 ms. Remains 35 /70 variables (removed 35) and now considering 30/65 (removed 35) transitions.
// Phase 1: matrix 30 rows 35 cols
[2024-06-01 11:36:19] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 11:36:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 11:36:19] [INFO ] Invariant cache hit.
[2024-06-01 11:36:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 11:36:19] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 11:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 11:36:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/65 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 48 constraints, problems are : Problem set: 0 solved, 29 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/65 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 77 constraints, problems are : Problem set: 0 solved, 29 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 592ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/70 places, 30/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 675 ms. Remains : 35/70 places, 30/65 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-08
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-001B-LTLFireability-08 finished in 727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1)||(p1&&F(!p2)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 6 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2024-06-01 11:36:20] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:36:20] [INFO ] Invariant cache hit.
[2024-06-01 11:36:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 11:36:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:36:20] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:36:21] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/121 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 85 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 11:36:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 17/17 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3421ms
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3501 ms. Remains : 63/70 places, 58/65 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/63 stabilizing places and 11/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 53 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-001B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-001B-LTLFireability-09 finished in 3954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p2))&&p1)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 59
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 64 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 64 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 58 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 51 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 51 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 50 transition count 45
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 37 transition count 32
Applied a total of 64 rules in 6 ms. Remains 37 /70 variables (removed 33) and now considering 32/65 (removed 33) transitions.
// Phase 1: matrix 32 rows 37 cols
[2024-06-01 11:36:24] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:36:24] [INFO ] Invariant cache hit.
[2024-06-01 11:36:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 11:36:24] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-06-01 11:36:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:24] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:36:24] [INFO ] Deduced a trap composed of 9 places in 12 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:24] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/69 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 52 constraints, problems are : Problem set: 0 solved, 31 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 31 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 850ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/70 places, 32/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 922 ms. Remains : 37/70 places, 32/65 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-14
Product exploration explored 100000 steps with 13954 reset in 100 ms.
Product exploration explored 100000 steps with 13963 reset in 86 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/37 stabilizing places and 2/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 13 factoid took 454 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 129 steps (0 resets) in 9 ms. (12 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 13 factoid took 836 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-06-01 11:36:27] [INFO ] Invariant cache hit.
[2024-06-01 11:36:27] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 11:36:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 11:36:27] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 11:36:27] [INFO ] Added : 31 causal constraints over 7 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 11:36:27] [INFO ] Invariant cache hit.
[2024-06-01 11:36:27] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 11:36:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 11:36:27] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 11:36:27] [INFO ] Added : 30 causal constraints over 6 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 11:36:27] [INFO ] Invariant cache hit.
[2024-06-01 11:36:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:36:27] [INFO ] Invariant cache hit.
[2024-06-01 11:36:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 11:36:27] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-06-01 11:36:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:36:27] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/69 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 52 constraints, problems are : Problem set: 0 solved, 31 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 31 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 897 ms. Remains : 37/37 places, 32/32 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/37 stabilizing places and 2/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 13 factoid took 383 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 149 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 13 factoid took 944 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-06-01 11:36:30] [INFO ] Invariant cache hit.
[2024-06-01 11:36:30] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-06-01 11:36:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 11:36:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:30] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 11:36:30] [INFO ] Added : 31 causal constraints over 7 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 11:36:30] [INFO ] Invariant cache hit.
[2024-06-01 11:36:30] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 11:36:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 11:36:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 11:36:30] [INFO ] Computed and/alt/rep : 31/77/31 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 11:36:30] [INFO ] Added : 30 causal constraints over 6 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 13935 reset in 84 ms.
Product exploration explored 100000 steps with 13969 reset in 87 ms.
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 11:36:30] [INFO ] Invariant cache hit.
[2024-06-01 11:36:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 11:36:30] [INFO ] Invariant cache hit.
[2024-06-01 11:36:30] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 11:36:30] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-06-01 11:36:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:30] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:36:30] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/69 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 52 constraints, problems are : Problem set: 0 solved, 31 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 31 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 832ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 903 ms. Remains : 37/37 places, 32/32 transitions.
Treatment of property ShieldPPPs-PT-001B-LTLFireability-14 finished in 7273 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)||X(G((p1&&X(G((p1||G(p2))))))))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 60
Applied a total of 10 rules in 1 ms. Remains 65 /70 variables (removed 5) and now considering 60/65 (removed 5) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-06-01 11:36:31] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 11:36:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 11:36:31] [INFO ] Invariant cache hit.
[2024-06-01 11:36:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-06-01 11:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/125 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 90 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/149 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:36:34] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 154 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 3599ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3599ms
Starting structural reductions in LTL mode, iteration 1 : 65/70 places, 60/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3677 ms. Remains : 65/70 places, 60/65 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-15
Product exploration explored 100000 steps with 3005 reset in 91 ms.
Product exploration explored 100000 steps with 2999 reset in 105 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 843 steps (1 resets) in 13 ms. (60 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-01 11:36:36] [INFO ] Invariant cache hit.
[2024-06-01 11:36:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 11:36:36] [INFO ] Invariant cache hit.
[2024-06-01 11:36:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-06-01 11:36:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:36] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:36:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/125 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 90 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1539 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/149 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:36:38] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:36:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:36:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 154 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 3532ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3532ms
Finished structural reductions in LTL mode , in 1 iterations and 3611 ms. Remains : 65/65 places, 60/60 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1486 steps (3 resets) in 25 ms. (57 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2993 reset in 87 ms.
Product exploration explored 100000 steps with 2997 reset in 100 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 65 transition count 62
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 65 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 31 place count 65 transition count 62
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 57 transition count 54
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 57 transition count 54
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 47 rules in 13 ms. Remains 57 /65 variables (removed 8) and now considering 54/60 (removed 6) transitions.
[2024-06-01 11:36:41] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 57 cols
[2024-06-01 11:36:41] [INFO ] Computed 12 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-01 11:36:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/21 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/78 constraints. Problems are: Problem set: 25 solved, 28 unsolved
[2024-06-01 11:36:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/79 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/79 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/79 constraints. Problems are: Problem set: 25 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 79 constraints, problems are : Problem set: 25 solved, 28 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 25 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 24/57 variables, 12/12 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/79 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 28/107 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/107 constraints. Problems are: Problem set: 25 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/107 constraints. Problems are: Problem set: 25 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 107 constraints, problems are : Problem set: 25 solved, 28 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 28/53 constraints, Known Traps: 10/10 constraints]
After SMT, in 1132ms problems are : Problem set: 25 solved, 28 unsolved
Search for dead transitions found 25 dead transitions in 1133ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 57/65 places, 29/60 transitions.
Graph (complete) has 87 edges and 57 vertex of which 34 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 34 /57 variables (removed 23) and now considering 29/29 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/65 places, 29/60 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1162 ms. Remains : 34/65 places, 29/60 transitions.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 65 cols
[2024-06-01 11:36:42] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 11:36:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 11:36:42] [INFO ] Invariant cache hit.
[2024-06-01 11:36:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-06-01 11:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/125 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 90 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/149 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:36:44] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:36:44] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-01 11:36:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:36:45] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 154 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 3447ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3448ms
Finished structural reductions in LTL mode , in 1 iterations and 3529 ms. Remains : 65/65 places, 60/60 transitions.
Treatment of property ShieldPPPs-PT-001B-LTLFireability-15 finished in 14693 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)))'
Found a Shortening insensitive property : ShieldPPPs-PT-001B-LTLFireability-01
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 62 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 51 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 51 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 49 transition count 44
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 2 with 30 rules applied. Total rules applied 70 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 33 transition count 28
Applied a total of 71 rules in 12 ms. Remains 33 /70 variables (removed 37) and now considering 28/65 (removed 37) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-06-01 11:36:46] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 11:36:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 11:36:46] [INFO ] Invariant cache hit.
[2024-06-01 11:36:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-06-01 11:36:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:46] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 618ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/70 places, 28/65 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 699 ms. Remains : 33/70 places, 28/65 transitions.
Running random walk in product with property : ShieldPPPs-PT-001B-LTLFireability-01
Product exploration explored 100000 steps with 33531 reset in 59 ms.
Product exploration explored 100000 steps with 33743 reset in 59 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/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:36:47] [INFO ] Invariant cache hit.
[2024-06-01 11:36:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:47] [INFO ] Computed and/alt/rep : 26/48/26 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 11:36:47] [INFO ] Added : 23 causal constraints over 6 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 11:36:47] [INFO ] Invariant cache hit.
[2024-06-01 11:36:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:36:47] [INFO ] Invariant cache hit.
[2024-06-01 11:36:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 11:36:48] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 11:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:48] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:48] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 622ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 33/33 places, 28/28 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/33 stabilizing places and 2/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
[2024-06-01 11:36:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 11:36:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:36:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 11:36:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 11:36:49] [INFO ] Computed and/alt/rep : 26/48/26 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 11:36:49] [INFO ] Added : 23 causal constraints over 6 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33436 reset in 56 ms.
Product exploration explored 100000 steps with 33463 reset in 65 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
[2024-06-01 11:36:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
[2024-06-01 11:36:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 11:36:49] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 28/61 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 26/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 11:36:50] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 33/33 places, 28/28 transitions.
Treatment of property ShieldPPPs-PT-001B-LTLFireability-01 finished in 4081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p2))&&p1)))))'
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)||X(G((p1&&X(G((p1||G(p2))))))))))'
[2024-06-01 11:36:50] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:36:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 11:36:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 65 transitions and 178 arcs took 1 ms.
Total runtime 64208 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-001B-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-001B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-001B-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717241816107

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-001B-LTLFireability-01
ltl formula formula --ltl=/tmp/2430/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 70 places, 65 transitions and 178 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.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2430/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2430/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2430/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2430/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 72 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 71, there are 68 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( 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: 1533
pnml2lts-mc( 0/ 4): unique states count: 1533
pnml2lts-mc( 0/ 4): unique transitions count: 3284
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1926
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1695
pnml2lts-mc( 0/ 4): - cum. max stack depth: 130
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1695 states 3861 transitions, fanout: 2.278
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 169500, Transitions per second: 386100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.0 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 65 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-001B-LTLFireability-14
ltl formula formula --ltl=/tmp/2430/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 70 places, 65 transitions and 178 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/2430/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2430/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2430/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2430/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 71 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 71, there are 100 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( 0/ 4): ~63 levels ~10000 states ~30456 transitions
pnml2lts-mc( 0/ 4): ~63 levels ~20000 states ~53368 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~40000 states ~102404 transitions
pnml2lts-mc( 3/ 4): ~73 levels ~80000 states ~217988 transitions
pnml2lts-mc( 2/ 4): ~101 levels ~160000 states ~466696 transitions
pnml2lts-mc( 2/ 4): ~108 levels ~320000 states ~924296 transitions
pnml2lts-mc( 2/ 4): ~108 levels ~640000 states ~1926660 transitions
pnml2lts-mc( 3/ 4): ~113 levels ~1280000 states ~4418304 transitions
pnml2lts-mc( 3/ 4): ~127 levels ~2560000 states ~9593324 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~2483!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2908754
pnml2lts-mc( 0/ 4): unique states count: 2911551
pnml2lts-mc( 0/ 4): unique transitions count: 13878444
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 10962427
pnml2lts-mc( 0/ 4): - claim found count: 1648
pnml2lts-mc( 0/ 4): - claim success count: 2913022
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2882
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2913022 states 13889877 transitions, fanout: 4.768
pnml2lts-mc( 0/ 4): Total exploration time 4.760 sec (4.760 sec minimum, 4.760 sec on average)
pnml2lts-mc( 0/ 4): States per second: 611979, Transitions per second: 2918041
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 22.4MB, 8.0 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 65 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 22.4MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-001B-LTLFireability-15
ltl formula formula --ltl=/tmp/2430/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 70 places, 65 transitions and 178 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2430/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2430/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2430/ltl_2_
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/2430/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 72 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 71, there are 76 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( 1/ 4): ~52 levels ~10000 states ~30780 transitions
pnml2lts-mc( 1/ 4): ~58 levels ~20000 states ~73632 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: 28147
pnml2lts-mc( 0/ 4): unique states count: 28147
pnml2lts-mc( 0/ 4): unique transitions count: 122364
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 94934
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 28792
pnml2lts-mc( 0/ 4): - cum. max stack depth: 232
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28792 states 125599 transitions, fanout: 4.362
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 205657, Transitions per second: 897136
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 8.5 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 65 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~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="ShieldPPPs-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 ShieldPPPs-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-171683760900364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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