fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683759000548
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldPPPt-PT-002A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
453.212 30706.00 47616.00 353.60 FFTFFFFFTFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759000548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPt-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759000548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K 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 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 14K 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 ShieldPPPt-PT-002A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-002A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717004649194

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-002A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:44:10] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-29 17:44:10] [INFO ] Transformed 53 places.
[2024-05-29 17:44:10] [INFO ] Transformed 39 transitions.
[2024-05-29 17:44:10] [INFO ] Found NUPN structural information;
[2024-05-29 17:44:10] [INFO ] Parsed PT model containing 53 places and 39 transitions and 150 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-002A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 8 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:10] [INFO ] Computed 23 invariants in 8 ms
[2024-05-29 17:44:10] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-29 17:44:10] [INFO ] Invariant cache hit.
[2024-05-29 17:44:10] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 639 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 497 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1180ms
Finished structural reductions in LTL mode , in 1 iterations and 1483 ms. Remains : 53/53 places, 38/38 transitions.
Support contains 42 out of 53 places after structural reductions.
[2024-05-29 17:44:12] [INFO ] Flatten gal took : 21 ms
[2024-05-29 17:44:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 17:44:12] [INFO ] Input system was already deterministic with 38 transitions.
Reduction of identical properties reduced properties to check from 30 to 27
RANDOM walk for 500 steps (0 resets) in 41 ms. (11 steps per ms) remains 0/27 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((p1&&(!p2 U (p3||G(!p2)))))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 13 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:13] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants in 49 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 34
Applied a total of 4 rules in 8 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2024-05-29 17:44:13] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants in 41 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/53 places, 34/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 32
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2024-05-29 17:44:13] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 17:44:13] [INFO ] Invariant cache hit.
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/53 places, 32/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 203 ms. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-00
Product exploration explored 100000 steps with 1358 reset in 354 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-00 finished in 825 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((!p0 U (p1 U !p2))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:13] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants in 47 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 34
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2024-05-29 17:44:13] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:44:13] [INFO ] Implicit Places using invariants in 48 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/53 places, 34/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 33
Applied a total of 2 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 45 cols
[2024-05-29 17:44:13] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:44:14] [INFO ] Invariant cache hit.
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 45/53 places, 33/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 217 ms. Remains : 45/53 places, 33/38 transitions.
Stuttering acceptance computed with spot in 163 ms :[p2, true, p2, p2]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-01
Product exploration explored 100000 steps with 1840 reset in 180 ms.
Stack based approach found an accepted trace after 6042 steps with 121 reset with depth 74 and stack size 73 in 14 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-01 finished in 596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 10 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:14] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants in 44 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 34
Applied a total of 4 rules in 10 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2024-05-29 17:44:14] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants in 40 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/53 places, 34/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 32
Applied a total of 4 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2024-05-29 17:44:14] [INFO ] Computed 20 invariants in 3 ms
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 17:44:14] [INFO ] Invariant cache hit.
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/53 places, 32/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 219 ms. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-03
Product exploration explored 100000 steps with 1462 reset in 136 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-03 finished in 404 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' '!((((p0 U p1)&&X((p2 U X(p3)))) U (p4||X(p1))))'
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:14] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:44:14] [INFO ] Invariant cache hit.
[2024-05-29 17:44:14] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 462 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 464 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 936ms
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p4)), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), true, (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-04 finished in 1343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p1)||p0)&&(X(F(p3))||p2)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:16] [INFO ] Invariant cache hit.
[2024-05-29 17:44:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 17:44:16] [INFO ] Invariant cache hit.
[2024-05-29 17:44:16] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 422 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 501 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 934ms
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-05
Product exploration explored 100000 steps with 4052 reset in 172 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-05 finished in 1567 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((X(p0)&&(G(p1)||X(p2)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:17] [INFO ] Invariant cache hit.
[2024-05-29 17:44:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:44:17] [INFO ] Invariant cache hit.
[2024-05-29 17:44:17] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 425 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 507 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-06
Product exploration explored 100000 steps with 33193 reset in 109 ms.
Stack based approach found an accepted trace after 117 steps with 36 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-06 finished in 1407 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 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 8 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:19] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants in 41 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 50 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 35
Applied a total of 2 rules in 3 ms. Remains 49 /50 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 49 cols
[2024-05-29 17:44:19] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants in 34 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/53 places, 35/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 34
Applied a total of 2 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 34/35 (removed 1) transitions.
// Phase 1: matrix 34 rows 47 cols
[2024-05-29 17:44:19] [INFO ] Computed 21 invariants in 0 ms
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 17:44:19] [INFO ] Invariant cache hit.
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/53 places, 34/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 177 ms. Remains : 47/53 places, 34/38 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-07
Product exploration explored 100000 steps with 2606 reset in 131 ms.
Stack based approach found an accepted trace after 50 steps with 1 reset with depth 29 and stack size 29 in 1 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-07 finished in 475 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' '!(((!p0 U p1) U X(G(p2))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:19] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 17:44:19] [INFO ] Invariant cache hit.
[2024-05-29 17:44:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 418 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 491 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 918ms
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/53 stabilizing places and 1/38 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 140 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 20 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
[2024-05-29 17:44:21] [INFO ] Invariant cache hit.
[2024-05-29 17:44:21] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-05-29 17:44:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-29 17:44:21] [INFO ] Computed and/alt/rep : 37/111/37 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 17:44:21] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:21] [INFO ] Invariant cache hit.
[2024-05-29 17:44:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:44:21] [INFO ] Invariant cache hit.
[2024-05-29 17:44:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 420 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 479 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 905ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 907ms
Finished structural reductions in LTL mode , in 1 iterations and 1007 ms. Remains : 53/53 places, 38/38 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/53 stabilizing places and 1/38 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (NOT p2)]
[2024-05-29 17:44:23] [INFO ] Invariant cache hit.
[2024-05-29 17:44:23] [INFO ] [Real]Absence check using 23 positive place invariants in 2 ms returned sat
[2024-05-29 17:44:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-29 17:44:23] [INFO ] Computed and/alt/rep : 37/111/37 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 17:44:23] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 38
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 10 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:24] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:24] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:44:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 17:44:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 7 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 17:44:24] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 38/91 variables, 53/131 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 133 constraints, problems are : Problem set: 2 solved, 35 unsolved in 783 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 23/73 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/76 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 38/91 variables, 53/131 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 35/168 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 168 constraints, problems are : Problem set: 2 solved, 35 unsolved in 485 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/37 constraints, Known Traps: 2/2 constraints]
After SMT, in 1278ms problems are : Problem set: 2 solved, 35 unsolved
Search for dead transitions found 2 dead transitions in 1282ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 36/38 transitions.
Graph (complete) has 124 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 36/38 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1310 ms. Remains : 51/53 places, 36/38 transitions.
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:25] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 17:44:25] [INFO ] Invariant cache hit.
[2024-05-29 17:44:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 412 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 509 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 928ms
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 53/53 places, 38/38 transitions.
Treatment of property ShieldPPPt-PT-002A-LTLFireability-08 finished in 6959 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 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 4 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:26] [INFO ] Implicit Places using invariants in 50 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 34
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2024-05-29 17:44:26] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:44:26] [INFO ] Implicit Places using invariants in 41 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/53 places, 34/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 32
Applied a total of 4 rules in 2 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2024-05-29 17:44:26] [INFO ] Computed 20 invariants in 0 ms
[2024-05-29 17:44:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:44:26] [INFO ] Invariant cache hit.
[2024-05-29 17:44:26] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/53 places, 32/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 191 ms. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-09 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U !((F(p0)||p2)&&p1))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-29 17:44:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 17:44:27] [INFO ] Invariant cache hit.
[2024-05-29 17:44:27] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 422 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 485 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 914ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 914ms
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 382 ms :[true, (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-10 finished in 1414 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)&&X(G(p1))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:28] [INFO ] Invariant cache hit.
[2024-05-29 17:44:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 17:44:28] [INFO ] Invariant cache hit.
[2024-05-29 17:44:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 405 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 471 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 880ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 882ms
Finished structural reductions in LTL mode , in 1 iterations and 979 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-11 finished in 1144 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||X(p1)) U !p2))) U p2))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:29] [INFO ] Invariant cache hit.
[2024-05-29 17:44:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 17:44:29] [INFO ] Invariant cache hit.
[2024-05-29 17:44:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 410 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 478 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Finished structural reductions in LTL mode , in 1 iterations and 993 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), p2, (AND (NOT p1) p2), p2]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-13
Product exploration explored 100000 steps with 5801 reset in 132 ms.
Stack based approach found an accepted trace after 60 steps with 5 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-13 finished in 1319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-29 17:44:30] [INFO ] Invariant cache hit.
[2024-05-29 17:44:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 17:44:30] [INFO ] Invariant cache hit.
[2024-05-29 17:44:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 17:44:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 129 constraints, problems are : Problem set: 0 solved, 37 unsolved in 395 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 53/129 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 166 constraints, problems are : Problem set: 0 solved, 37 unsolved in 504 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 906ms
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 53/53 places, 38/38 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-14 finished in 1105 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 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 36
Applied a total of 4 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-29 17:44:31] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants in 44 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 36/38 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 50 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 34
Applied a total of 4 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 48 cols
[2024-05-29 17:44:32] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants in 42 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/53 places, 34/38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 32
Applied a total of 4 rules in 9 ms. Remains 44 /46 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 44 cols
[2024-05-29 17:44:32] [INFO ] Computed 20 invariants in 0 ms
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 17:44:32] [INFO ] Invariant cache hit.
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/53 places, 32/38 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 188 ms. Remains : 44/53 places, 32/38 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-15
Product exploration explored 100000 steps with 6505 reset in 104 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-002A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002A-LTLFireability-15 finished in 437 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' '!(((!p0 U p1) U X(G(p2))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-002A-LTLFireability-08
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 38/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 37
Applied a total of 2 rules in 6 ms. Remains 52 /53 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 52 cols
[2024-05-29 17:44:32] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 17:44:32] [INFO ] Invariant cache hit.
[2024-05-29 17:44:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 17:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 127 constraints, problems are : Problem set: 0 solved, 36 unsolved in 393 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 36/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 163 constraints, problems are : Problem set: 0 solved, 36 unsolved in 453 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 851ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 851ms
Starting structural reductions in LI_LTL mode, iteration 1 : 52/53 places, 37/38 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 956 ms. Remains : 52/53 places, 37/38 transitions.
Running random walk in product with property : ShieldPPPt-PT-002A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/52 stabilizing places and 1/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 310 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p0)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p1 p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F p2)]
Knowledge based reduction with 17 factoid took 369 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (NOT p2)]
[2024-05-29 17:44:35] [INFO ] Invariant cache hit.
[2024-05-29 17:44:35] [INFO ] [Real]Absence check using 23 positive place invariants in 2 ms returned sat
[2024-05-29 17:44:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 17:44:35] [INFO ] Computed and/alt/rep : 36/111/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 17:44:35] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-29 17:44:35] [INFO ] Invariant cache hit.
[2024-05-29 17:44:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 17:44:35] [INFO ] Invariant cache hit.
[2024-05-29 17:44:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 17:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 127 constraints, problems are : Problem set: 0 solved, 36 unsolved in 405 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 36/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 163 constraints, problems are : Problem set: 0 solved, 36 unsolved in 444 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 857ms
Finished structural reductions in LTL mode , in 1 iterations and 950 ms. Remains : 52/52 places, 37/37 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/52 stabilizing places and 1/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
[2024-05-29 17:44:36] [INFO ] Invariant cache hit.
[2024-05-29 17:44:36] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2024-05-29 17:44:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-29 17:44:36] [INFO ] Computed and/alt/rep : 36/111/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 17:44:36] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 159 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 37/37 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-29 17:44:37] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 37 rows 52 cols
[2024-05-29 17:44:37] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 17:44:37] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/76 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 37/89 variables, 52/128 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 130 constraints, problems are : Problem set: 1 solved, 35 unsolved in 616 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 23/73 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/75 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/76 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 37/89 variables, 52/128 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 35/165 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 165 constraints, problems are : Problem set: 1 solved, 35 unsolved in 497 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 35/36 constraints, Known Traps: 1/1 constraints]
After SMT, in 1121ms problems are : Problem set: 1 solved, 35 unsolved
Search for dead transitions found 1 dead transitions in 1122ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 36/37 transitions.
Graph (complete) has 124 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 36/36 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/52 places, 36/37 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1144 ms. Remains : 51/52 places, 36/37 transitions.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 52 cols
[2024-05-29 17:44:38] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:44:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:44:38] [INFO ] Invariant cache hit.
[2024-05-29 17:44:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-29 17:44:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 127 constraints, problems are : Problem set: 0 solved, 36 unsolved in 391 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 37/89 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 36/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 163 constraints, problems are : Problem set: 0 solved, 36 unsolved in 439 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 842ms
Finished structural reductions in LTL mode , in 1 iterations and 943 ms. Remains : 52/52 places, 37/37 transitions.
Treatment of property ShieldPPPt-PT-002A-LTLFireability-08 finished in 6891 ms.
[2024-05-29 17:44:39] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:44:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 17:44:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 38 transitions and 148 arcs took 3 ms.
Total runtime 28934 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-002A

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1381
MODEL NAME: /home/mcc/execution/412/model
53 places, 38 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldPPPt-PT-002A-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717004679900

--------------------
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

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="ShieldPPPt-PT-002A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPt-PT-002A, 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 r355-tall-171683759000548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002A.tgz
mv ShieldPPPt-PT-002A 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 ;