Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717223207122

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:26:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:26:48] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-06-01 06:26:48] [INFO ] Transformed 53 places.
[2024-06-01 06:26:48] [INFO ] Transformed 51 transitions.
[2024-06-01 06:26:48] [INFO ] Found NUPN structural information;
[2024-06-01 06:26:48] [INFO ] Parsed PT model containing 53 places and 51 transitions and 222 arcs in 149 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 3 formulas.
FORMULA ShieldIIPs-PT-002A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:26:48] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:26:48] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 06:26:48] [INFO ] Invariant cache hit.
[2024-06-01 06:26:48] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:26:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 7 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1151 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1040 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 2236ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2255ms
Finished structural reductions in LTL mode , in 1 iterations and 2563 ms. Remains : 53/53 places, 51/51 transitions.
Support contains 39 out of 53 places after structural reductions.
[2024-06-01 06:26:51] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:26:51] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:26:51] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 37 out of 53 places (down from 39) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 28
RANDOM walk for 3190 steps (20 resets) in 179 ms. (17 steps per ms) remains 0/28 properties
FORMULA ShieldIIPs-PT-002A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((p0 U (F(G((p0||X(X(X(!p0))))))&&G(p1))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:26:51] [INFO ] Invariant cache hit.
[2024-06-01 06:26:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 06:26:52] [INFO ] Invariant cache hit.
[2024-06-01 06:26:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:26:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1032 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 766 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1821ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1822ms
Finished structural reductions in LTL mode , in 1 iterations and 1953 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 612 ms :[(NOT p1), true, false, (NOT p1), false, false, false, false, false, false, false]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 48 steps with 9 reset in 2 ms.
FORMULA ShieldIIPs-PT-002A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLFireability-00 finished in 2643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&F((p0||X(p2)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:26:54] [INFO ] Invariant cache hit.
[2024-06-01 06:26:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 06:26:54] [INFO ] Invariant cache hit.
[2024-06-01 06:26:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:26:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 860 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 767 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1652ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1653ms
Finished structural reductions in LTL mode , in 1 iterations and 1774 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-01
Product exploration explored 100000 steps with 15442 reset in 260 ms.
Product exploration explored 100000 steps with 15439 reset in 186 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (282 resets) in 402 ms. (99 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (58 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2024-06-01 06:26:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/53 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 33/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 51/104 variables, 53/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 6/104 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 6/53 constraints, Positive P Invariants (semi-flows): 0/19 constraints, State Equation: 0/53 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 14 factoid took 500 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 06:26:58] [INFO ] Invariant cache hit.
[2024-06-01 06:26:59] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:26:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:26:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 06:26:59] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:26:59] [INFO ] Added : 36 causal constraints over 8 iterations in 71 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 06:26:59] [INFO ] Invariant cache hit.
[2024-06-01 06:26:59] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 06:26:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:26:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:26:59] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:26:59] [INFO ] Added : 46 causal constraints over 10 iterations in 75 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 50
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 50
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 4 place count 51 transition count 49
Applied a total of 4 rules in 21 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:26:59] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:26:59] [INFO ] Implicit Places using invariants in 51 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/53 places, 49/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 50/53 places, 49/51 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 102 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (305 resets) in 477 ms. (83 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (67 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
// Phase 1: matrix 49 rows 50 cols
[2024-06-01 06:27:00] [INFO ] Computed 18 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/50 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/99 variables, 50/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 6/99 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 6/50 constraints, Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 26 factoid took 496 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 06:27:01] [INFO ] Invariant cache hit.
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:27:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:01] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-06-01 06:27:01] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 10 ms.
[2024-06-01 06:27:01] [INFO ] Added : 46 causal constraints over 10 iterations in 73 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 06:27:01] [INFO ] Invariant cache hit.
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:01] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:27:01] [INFO ] Added : 42 causal constraints over 9 iterations in 93 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 20124 reset in 126 ms.
Product exploration explored 100000 steps with 20193 reset in 147 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 06:27:02] [INFO ] Invariant cache hit.
[2024-06-01 06:27:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:27:02] [INFO ] Invariant cache hit.
[2024-06-01 06:27:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 06:27:02] [INFO ] Redundant transitions in 14 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-06-01 06:27:02] [INFO ] Computed 18 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/98 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/98 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1192 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 47/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 169 constraints, problems are : Problem set: 0 solved, 47 unsolved in 729 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/50 places, 48/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2057 ms. Remains : 50/50 places, 48/49 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-01 finished in 10074 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 (!p2&&G(!p0))))'
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 50
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 50
Applied a total of 2 rules in 5 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:27:04] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:04] [INFO ] Implicit Places using invariants in 43 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/53 places, 50/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51 ms. Remains : 51/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR p2 p0), true, (AND (NOT p2) (NOT p1) (NOT p0)), p0, p0]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLFireability-02 finished in 276 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(F(p1)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:27:04] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:27:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 06:27:04] [INFO ] Invariant cache hit.
[2024-06-01 06:27:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 852 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 772 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1633ms
Finished structural reductions in LTL mode , in 1 iterations and 1715 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002A-LTLFireability-04 finished in 2103 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)||X((G((p2||F(p3)))||p1))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:27:07] [INFO ] Invariant cache hit.
[2024-06-01 06:27:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 06:27:07] [INFO ] Invariant cache hit.
[2024-06-01 06:27:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 859 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 759 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1628ms
Finished structural reductions in LTL mode , in 1 iterations and 1728 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0) p2)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 13 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002A-LTLFireability-05 finished in 2237 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 (X((G(p1)||G(p2))) U (F(p0) U p2))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:27:09] [INFO ] Invariant cache hit.
[2024-06-01 06:27:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:27:09] [INFO ] Invariant cache hit.
[2024-06-01 06:27:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 814 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 785 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1608ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1609ms
Finished structural reductions in LTL mode , in 1 iterations and 1699 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-06
Product exploration explored 100000 steps with 4925 reset in 104 ms.
Product exploration explored 100000 steps with 4949 reset in 118 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 102 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 106 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 26 factoid took 215 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 06:27:12] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:12] [INFO ] Added : 47 causal constraints over 10 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:12] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:27:12] [INFO ] Added : 41 causal constraints over 12 iterations in 82 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 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, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
[2024-06-01 06:27:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 815 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 742 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1564ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1565ms
Finished structural reductions in LTL mode , in 1 iterations and 1659 ms. Remains : 53/53 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:27:15] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:27:15] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:27:15] [INFO ] Added : 47 causal constraints over 10 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:15] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:15] [INFO ] Computed and/alt/rep : 48/175/48 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:27:15] [INFO ] Added : 41 causal constraints over 12 iterations in 76 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 4958 reset in 102 ms.
Product exploration explored 100000 steps with 4939 reset in 117 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 51
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:27:16] [INFO ] Redundant transitions in 16 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 49 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 53 cols
[2024-06-01 06:27:16] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:16] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/76 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 50/103 variables, 53/129 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 3/132 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/103 variables, 2/134 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/103 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/103 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 135 constraints, problems are : Problem set: 2 solved, 47 unsolved in 1470 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 19/69 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/72 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 7/79 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 50/103 variables, 53/132 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 3/135 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 47/182 constraints. Problems are: Problem set: 2 solved, 47 unsolved
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 183 constraints, problems are : Problem set: 2 solved, 47 unsolved in 1223 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2705ms problems are : Problem set: 2 solved, 47 unsolved
Search for dead transitions found 2 dead transitions in 2707ms
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, 48/51 transitions.
Graph (complete) has 175 edges and 53 vertex of which 51 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 51 /53 variables (removed 2) and now considering 48/48 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 48/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2746 ms. Remains : 51/53 places, 48/51 transitions.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:27:19] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 06:27:19] [INFO ] Invariant cache hit.
[2024-06-01 06:27:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 6 ms to minimize.
[2024-06-01 06:27:19] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 895 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 785 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1687ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1688ms
Finished structural reductions in LTL mode , in 1 iterations and 1784 ms. Remains : 53/53 places, 51/51 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-06 finished in 11606 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(((X(p0) U !p1)||X(G(p2))))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 50
Applied a total of 2 rules in 3 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:27:20] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:27:21] [INFO ] Invariant cache hit.
[2024-06-01 06:27:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 06:27:21] [INFO ] Redundant transitions in 16 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 880 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1670 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2559ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/53 places, 50/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2684 ms. Remains : 52/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-08
Product exploration explored 100000 steps with 1738 reset in 173 ms.
Product exploration explored 100000 steps with 1758 reset in 188 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
RANDOM walk for 276 steps (0 resets) in 5 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 4 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
[2024-06-01 06:27:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
[2024-06-01 06:27:24] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 06:27:24] [INFO ] Redundant transitions in 16 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 888 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1636 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2534ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2534ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2641 ms. Remains : 52/52 places, 50/50 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
RANDOM walk for 416 steps (0 resets) in 8 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 1718 reset in 142 ms.
Product exploration explored 100000 steps with 1688 reset in 148 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 50/50 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 52 transition count 49
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 51 transition count 49
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 49/50 (removed 1) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:27:28] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:28] [INFO ] Implicit Places using invariants in 42 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/52 places, 49/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 50/52 places, 49/50 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-08 finished in 7370 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(p0))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:27:28] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:27:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 06:27:28] [INFO ] Invariant cache hit.
[2024-06-01 06:27:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 841 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 755 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1606ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1607ms
Finished structural reductions in LTL mode , in 1 iterations and 1699 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002A-LTLFireability-10 finished in 2080 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(p1)&&F(G(p2)))))'
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 50
Applied a total of 2 rules in 9 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:27:30] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 06:27:30] [INFO ] Invariant cache hit.
[2024-06-01 06:27:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 06:27:30] [INFO ] Redundant transitions in 13 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:30] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 887 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:27:32] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1547 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2457ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2457ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/53 places, 50/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2568 ms. Remains : 52/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-12
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLFireability-12 finished in 2753 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(X(p0)) U p1)&&G(p0)&&p2)))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-06-01 06:27:33] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:27:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 06:27:33] [INFO ] Invariant cache hit.
[2024-06-01 06:27:33] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:33] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 811 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 729 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1549ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1550ms
Finished structural reductions in LTL mode , in 1 iterations and 1637 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLFireability-13 finished in 1789 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((F(p1)&&(p2||X(p3))&&p0))&&X(X(G(p1)))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 06:27:34] [INFO ] Invariant cache hit.
[2024-06-01 06:27:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 06:27:34] [INFO ] Invariant cache hit.
[2024-06-01 06:27:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 06:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 128 constraints, problems are : Problem set: 0 solved, 50 unsolved in 835 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 178 constraints, problems are : Problem set: 0 solved, 50 unsolved in 782 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1626ms
Finished structural reductions in LTL mode , in 1 iterations and 1721 ms. Remains : 53/53 places, 51/51 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 99 steps with 2 reset in 0 ms.
FORMULA ShieldIIPs-PT-002A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002A-LTLFireability-14 finished in 2082 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(p1))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 50
Applied a total of 2 rules in 7 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-06-01 06:27:36] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 06:27:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 06:27:37] [INFO ] Invariant cache hit.
[2024-06-01 06:27:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-01 06:27:37] [INFO ] Redundant transitions in 13 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 852 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1681 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2545ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/53 places, 50/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2658 ms. Remains : 52/53 places, 50/51 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-15
Product exploration explored 100000 steps with 4324 reset in 112 ms.
Product exploration explored 100000 steps with 4360 reset in 120 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 122 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 06:27:40] [INFO ] Invariant cache hit.
[2024-06-01 06:27:40] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:27:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:40] [INFO ] Computed and/alt/rep : 47/182/47 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:40] [INFO ] Added : 43 causal constraints over 9 iterations in 74 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-01 06:27:40] [INFO ] Invariant cache hit.
[2024-06-01 06:27:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:27:40] [INFO ] Invariant cache hit.
[2024-06-01 06:27:40] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 06:27:40] [INFO ] Redundant transitions in 13 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 851 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1635 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2494ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2596 ms. Remains : 52/52 places, 50/50 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 98 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 06:27:43] [INFO ] Invariant cache hit.
[2024-06-01 06:27:44] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-01 06:27:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:44] [INFO ] Computed and/alt/rep : 47/182/47 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:44] [INFO ] Added : 43 causal constraints over 9 iterations in 58 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4326 reset in 118 ms.
Product exploration explored 100000 steps with 4336 reset in 129 ms.
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 50/50 transitions.
Applied a total of 0 rules in 8 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-01 06:27:44] [INFO ] Invariant cache hit.
[2024-06-01 06:27:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 06:27:44] [INFO ] Invariant cache hit.
[2024-06-01 06:27:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-06-01 06:27:44] [INFO ] Redundant transitions in 14 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 06:27:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:27:45] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 127 constraints, problems are : Problem set: 0 solved, 49 unsolved in 929 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 50/102 variables, 52/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 49/176 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:45] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 180 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1605 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
After SMT, in 2545ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2546ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2687 ms. Remains : 52/52 places, 50/50 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-15 finished in 10231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&F((p0||X(p2)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-002A-LTLFireability-01
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 50
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 50
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 4 place count 51 transition count 49
Applied a total of 4 rules in 3 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:27:47] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:47] [INFO ] Implicit Places using invariants in 46 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 50/53 places, 49/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 54 ms. Remains : 50/53 places, 49/51 transitions.
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-01
Product exploration explored 100000 steps with 20112 reset in 91 ms.
Product exploration explored 100000 steps with 20107 reset in 108 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (301 resets) in 160 ms. (248 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (67 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
// Phase 1: matrix 49 rows 50 cols
[2024-06-01 06:27:48] [INFO ] Computed 18 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/50 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/99 variables, 50/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 6/99 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Domain max(s): 6/50 constraints, Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 14 factoid took 402 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 06:27:49] [INFO ] Invariant cache hit.
[2024-06-01 06:27:49] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-06-01 06:27:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:49] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
[2024-06-01 06:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 06:27:49] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-01 06:27:49] [INFO ] Added : 46 causal constraints over 10 iterations in 69 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 06:27:49] [INFO ] Invariant cache hit.
[2024-06-01 06:27:49] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:49] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:49] [INFO ] Added : 42 causal constraints over 9 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 06:27:49] [INFO ] Invariant cache hit.
[2024-06-01 06:27:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 06:27:49] [INFO ] Invariant cache hit.
[2024-06-01 06:27:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 06:27:49] [INFO ] Redundant transitions in 14 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-06-01 06:27:49] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:50] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:50] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/98 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/98 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1161 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 47/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 169 constraints, problems are : Problem set: 0 solved, 47 unsolved in 748 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 1918ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/50 places, 48/49 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2031 ms. Remains : 50/50 places, 48/49 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 126 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (300 resets) in 87 ms. (454 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (66 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-06-01 06:27:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/50 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/98 variables, 50/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 6/98 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 6/50 constraints, Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/50 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 26 factoid took 484 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2024-06-01 06:27:53] [INFO ] Invariant cache hit.
[2024-06-01 06:27:53] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 06:27:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:53] [INFO ] Computed and/alt/rep : 46/178/46 causal constraints (skipped 1 transitions) in 3 ms.
[2024-06-01 06:27:53] [INFO ] Added : 46 causal constraints over 10 iterations in 65 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2024-06-01 06:27:53] [INFO ] Invariant cache hit.
[2024-06-01 06:27:54] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:27:54] [INFO ] Computed and/alt/rep : 46/178/46 causal constraints (skipped 1 transitions) in 2 ms.
[2024-06-01 06:27:54] [INFO ] Added : 30 causal constraints over 6 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 20055 reset in 103 ms.
Product exploration explored 100000 steps with 20187 reset in 113 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 06:27:54] [INFO ] Invariant cache hit.
[2024-06-01 06:27:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:27:54] [INFO ] Invariant cache hit.
[2024-06-01 06:27:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 06:27:54] [INFO ] Redundant transitions in 13 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-01 06:27:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/98 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/98 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1152 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 47/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 170 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1050 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 2216ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2329 ms. Remains : 50/50 places, 48/48 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-01 finished in 9849 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 (X((G(p1)||G(p2))) U (F(p0) U p2))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-002A-LTLFireability-06
Stuttering acceptance computed with spot in 432 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 50
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 50
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 4 place count 51 transition count 49
Applied a total of 4 rules in 9 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2024-06-01 06:27:57] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 06:27:57] [INFO ] Implicit Places using invariants in 82 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 50/53 places, 49/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 94 ms. Remains : 50/53 places, 49/51 transitions.
Running random walk in product with property : ShieldIIPs-PT-002A-LTLFireability-06
Product exploration explored 100000 steps with 5703 reset in 124 ms.
Product exploration explored 100000 steps with 5727 reset in 121 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 123 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 67 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 26 factoid took 220 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
// Phase 1: matrix 49 rows 50 cols
[2024-06-01 06:27:58] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 06:27:58] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:27:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:58] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:58] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:58] [INFO ] Added : 42 causal constraints over 9 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 06:27:58] [INFO ] Invariant cache hit.
[2024-06-01 06:27:59] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:27:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 06:27:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:27:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-06-01 06:27:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:27:59] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-01 06:27:59] [INFO ] Added : 45 causal constraints over 11 iterations in 64 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 06:27:59] [INFO ] Invariant cache hit.
[2024-06-01 06:27:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 06:27:59] [INFO ] Invariant cache hit.
[2024-06-01 06:27:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 06:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/99 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/99 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1039 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/99 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 48/170 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:28:00] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 171 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1018 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
After SMT, in 2067ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2068ms
Finished structural reductions in LTL mode , in 1 iterations and 2160 ms. Remains : 50/50 places, 49/49 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 109 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 06:28:02] [INFO ] Invariant cache hit.
[2024-06-01 06:28:02] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2024-06-01 06:28:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 06:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:28:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:28:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:28:02] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:28:02] [INFO ] Added : 43 causal constraints over 9 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 06:28:02] [INFO ] Invariant cache hit.
[2024-06-01 06:28:02] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 06:28:02] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 06:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:28:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-06-01 06:28:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 06:28:02] [INFO ] Computed and/alt/rep : 46/173/46 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-01 06:28:02] [INFO ] Added : 45 causal constraints over 11 iterations in 62 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 5710 reset in 102 ms.
Product exploration explored 100000 steps with 5698 reset in 110 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 06:28:03] [INFO ] Redundant transitions in 17 ms returned [43]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 50 cols
[2024-06-01 06:28:03] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/98 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/98 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1160 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/98 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 47/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 169 constraints, problems are : Problem set: 0 solved, 47 unsolved in 701 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 1871ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1872ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/50 places, 48/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1905 ms. Remains : 50/50 places, 48/49 transitions.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 50 cols
[2024-06-01 06:28:05] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 06:28:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 06:28:05] [INFO ] Invariant cache hit.
[2024-06-01 06:28:05] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 06:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/99 variables, 50/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/99 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1016 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/99 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 48/170 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 06:28:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 171 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1021 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
After SMT, in 2045ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2047ms
Finished structural reductions in LTL mode , in 1 iterations and 2141 ms. Remains : 50/50 places, 49/49 transitions.
Treatment of property ShieldIIPs-PT-002A-LTLFireability-06 finished in 10295 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(((X(p0) U !p1)||X(G(p2))))))'
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(p1))))'
[2024-06-01 06:28:07] [INFO ] Flatten gal took : 15 ms
[2024-06-01 06:28:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 06:28:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 51 transitions and 222 arcs took 2 ms.
Total runtime 79356 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-002A-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-002A-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-002A-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-002A-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717223370968

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-002A-LTLFireability-01
ltl formula formula --ltl=/tmp/2942/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 53 places, 51 transitions and 222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2942/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2942/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2942/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2942/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 54 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 123 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 43
pnml2lts-mc( 0/ 4): unique states count: 43
pnml2lts-mc( 0/ 4): unique transitions count: 152
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 219
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 89
pnml2lts-mc( 0/ 4): - cum. max stack depth: 49
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 89 states 456 transitions, fanout: 5.124
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.1 B/state, compr.: 12.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 51 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-002A-LTLFireability-06
ltl formula formula --ltl=/tmp/2942/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 53 places, 51 transitions and 222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2942/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2942/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2942/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2942/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 599 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~80 levels ~10000 states ~21712 transitions
pnml2lts-mc( 2/ 4): ~80 levels ~20000 states ~45008 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~129!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 34013
pnml2lts-mc( 0/ 4): unique states count: 34376
pnml2lts-mc( 0/ 4): unique transitions count: 96420
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 60795
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34389
pnml2lts-mc( 0/ 4): - cum. max stack depth: 442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34389 states 96464 transitions, fanout: 2.805
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 214931, Transitions per second: 602900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 9.6 B/state, compr.: 4.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 51 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-002A-LTLFireability-08
ltl formula formula --ltl=/tmp/2942/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 53 places, 51 transitions and 222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2942/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2942/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2942/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2942/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 54 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 60 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~202 levels ~10000 states ~37556 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~20000 states ~82180 transitions
pnml2lts-mc( 0/ 4): ~1489 levels ~40000 states ~185228 transitions
pnml2lts-mc( 1/ 4): ~1872 levels ~80000 states ~414796 transitions
pnml2lts-mc( 1/ 4): ~2938 levels ~160000 states ~857172 transitions
pnml2lts-mc( 1/ 4): ~7392 levels ~320000 states ~1742648 transitions
pnml2lts-mc( 1/ 4): ~14125 levels ~640000 states ~3674940 transitions
pnml2lts-mc( 1/ 4): ~17327 levels ~1280000 states ~7655308 transitions
pnml2lts-mc( 1/ 4): ~20369 levels ~2560000 states ~15650208 transitions
pnml2lts-mc( 1/ 4): ~46049 levels ~5120000 states ~32459692 transitions
pnml2lts-mc( 1/ 4): ~100238 levels ~10240000 states ~67921472 transitions
pnml2lts-mc( 1/ 4): ~153121 levels ~20480000 states ~139176792 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3442018
pnml2lts-mc( 0/ 4): unique states count: 33470126
pnml2lts-mc( 0/ 4): unique transitions count: 231463223
pnml2lts-mc( 0/ 4): - self-loop count: 22
pnml2lts-mc( 0/ 4): - claim dead count: 68788434
pnml2lts-mc( 0/ 4): - claim found count: 128887156
pnml2lts-mc( 0/ 4): - claim success count: 33474802
pnml2lts-mc( 0/ 4): - cum. max stack depth: 915258
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33584723 states 232257583 transitions, fanout: 6.916
pnml2lts-mc( 0/ 4): Total exploration time 79.090 sec (79.070 sec minimum, 79.077 sec on average)
pnml2lts-mc( 0/ 4): States per second: 424639, Transitions per second: 2936624
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.0MB, 8.0 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 51 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-002A-LTLFireability-15
ltl formula formula --ltl=/tmp/2942/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 53 places, 51 transitions and 222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2942/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2942/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2942/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2942/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 76 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~53 levels ~10000 states ~22312 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~20000 states ~44708 transitions
pnml2lts-mc( 0/ 4): ~54 levels ~40000 states ~98356 transitions
pnml2lts-mc( 0/ 4): ~57 levels ~80000 states ~207504 transitions
pnml2lts-mc( 0/ 4): ~57 levels ~160000 states ~457344 transitions
pnml2lts-mc( 0/ 4): ~57 levels ~320000 states ~970020 transitions
pnml2lts-mc( 0/ 4): ~90 levels ~640000 states ~1917980 transitions
pnml2lts-mc( 0/ 4): ~90 levels ~1280000 states ~4005640 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~138!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1621885
pnml2lts-mc( 0/ 4): unique states count: 1622215
pnml2lts-mc( 0/ 4): unique transitions count: 5650652
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 4027911
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1623087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 452
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1623087 states 5655150 transitions, fanout: 3.484
pnml2lts-mc( 0/ 4): Total exploration time 2.830 sec (2.830 sec minimum, 2.830 sec on average)
pnml2lts-mc( 0/ 4): States per second: 573529, Transitions per second: 1998286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.8MB, 8.3 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 51 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-002A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-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 r528-tall-171683760200020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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