Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900324.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679439861276

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 23:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:04:24] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-21 23:04:24] [INFO ] Transformed 953 places.
[2023-03-21 23:04:24] [INFO ] Transformed 703 transitions.
[2023-03-21 23:04:24] [INFO ] Found NUPN structural information;
[2023-03-21 23:04:24] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 122 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:04:24] [INFO ] Computed 451 place invariants in 21 ms
[2023-03-21 23:04:26] [INFO ] Implicit Places using invariants in 1790 ms returned []
[2023-03-21 23:04:26] [INFO ] Invariant cache hit.
[2023-03-21 23:04:28] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2023-03-21 23:04:28] [INFO ] Invariant cache hit.
[2023-03-21 23:04:28] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4320 ms. Remains : 953/953 places, 702/702 transitions.
Support contains 57 out of 953 places after structural reductions.
[2023-03-21 23:04:29] [INFO ] Flatten gal took : 209 ms
[2023-03-21 23:04:29] [INFO ] Flatten gal took : 67 ms
[2023-03-21 23:04:29] [INFO ] Input system was already deterministic with 702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-21 23:04:30] [INFO ] Invariant cache hit.
[2023-03-21 23:04:31] [INFO ] [Real]Absence check using 451 positive place invariants in 134 ms returned sat
[2023-03-21 23:04:35] [INFO ] After 4841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-21 23:04:36] [INFO ] [Nat]Absence check using 451 positive place invariants in 129 ms returned sat
[2023-03-21 23:04:40] [INFO ] After 3069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-21 23:04:44] [INFO ] After 6631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 2948 ms.
[2023-03-21 23:04:47] [INFO ] After 11635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 5 properties in 4855 ms.
Support contains 35 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 99 place count 951 transition count 700
Applied a total of 99 rules in 196 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 951/953 places, 700/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Finished probabilistic random walk after 92533 steps, run visited all 20 properties in 2306 ms. (steps per millisecond=40 )
Probabilistic random walk after 92533 steps, saw 90534 distinct states, run finished after 2309 ms. (steps per millisecond=40 ) properties seen :20
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&F(!p1))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 157 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:04:56] [INFO ] Computed 451 place invariants in 3 ms
[2023-03-21 23:04:57] [INFO ] Implicit Places using invariants in 1011 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 51 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:04:57] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:04:57] [INFO ] Implicit Places using invariants in 592 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 593 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 44 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:04:57] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:04:58] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-21 23:04:58] [INFO ] Invariant cache hit.
[2023-03-21 23:04:59] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3976 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 458 ms :[p1, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s612 1) (EQ s625 1)), p0:(AND (EQ s278 1) (EQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 940 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-00 finished in 5476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 19 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:05:01] [INFO ] Computed 451 place invariants in 6 ms
[2023-03-21 23:05:02] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-21 23:05:02] [INFO ] Invariant cache hit.
[2023-03-21 23:05:03] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2023-03-21 23:05:03] [INFO ] Invariant cache hit.
[2023-03-21 23:05:04] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2798 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s147 1) (EQ s162 1)), p1:(EQ s322 1), p2:(OR (EQ s30 0) (EQ s34 0) (EQ s40 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 804 ms.
Product exploration explored 100000 steps with 0 reset in 988 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) p2), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44362 steps, run visited all 1 properties in 436 ms. (steps per millisecond=101 )
Probabilistic random walk after 44362 steps, saw 43567 distinct states, run finished after 437 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Support contains 3 out of 953 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 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 43 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:05:07] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-21 23:05:08] [INFO ] Implicit Places using invariants in 718 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 735 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 27 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:05:08] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:05:08] [INFO ] Implicit Places using invariants in 553 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 571 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 32 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:05:08] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:05:09] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-21 23:05:09] [INFO ] Invariant cache hit.
[2023-03-21 23:05:10] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3327 ms. Remains : 946/953 places, 698/702 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44396 steps, run visited all 1 properties in 424 ms. (steps per millisecond=104 )
Probabilistic random walk after 44396 steps, saw 43561 distinct states, run finished after 425 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 818 ms.
Product exploration explored 100000 steps with 0 reset in 1045 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 21 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:05:13] [INFO ] Invariant cache hit.
[2023-03-21 23:05:14] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-21 23:05:14] [INFO ] Invariant cache hit.
[2023-03-21 23:05:16] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
[2023-03-21 23:05:16] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-21 23:05:16] [INFO ] Invariant cache hit.
[2023-03-21 23:05:16] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3029 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-01 finished in 15555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:05:16] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-21 23:05:17] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-21 23:05:17] [INFO ] Invariant cache hit.
[2023-03-21 23:05:19] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2023-03-21 23:05:19] [INFO ] Invariant cache hit.
[2023-03-21 23:05:19] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2884 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(EQ s191 0), p0:(OR (EQ s746 0) (EQ s757 0)), p2:(OR (EQ s746 0) (EQ s757 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 793 ms.
Product exploration explored 100000 steps with 0 reset in 998 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 p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 2223 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 23:05:25] [INFO ] Invariant cache hit.
[2023-03-21 23:05:26] [INFO ] [Real]Absence check using 451 positive place invariants in 235 ms returned sat
[2023-03-21 23:05:27] [INFO ] After 1548ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-21 23:05:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 273 ms returned sat
[2023-03-21 23:05:28] [INFO ] After 1048ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-21 23:05:28] [INFO ] After 1228ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-21 23:05:29] [INFO ] After 1969ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 3862 steps, including 2 resets, run visited all 3 properties in 68 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 195 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 35 factoid took 2322 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:05:31] [INFO ] Invariant cache hit.
[2023-03-21 23:05:32] [INFO ] Implicit Places using invariants in 779 ms returned []
[2023-03-21 23:05:32] [INFO ] Invariant cache hit.
[2023-03-21 23:05:34] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2023-03-21 23:05:34] [INFO ] Invariant cache hit.
[2023-03-21 23:05:35] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3301 ms. Remains : 953/953 places, 702/702 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 p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 422 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:05:35] [INFO ] Invariant cache hit.
[2023-03-21 23:05:36] [INFO ] [Real]Absence check using 451 positive place invariants in 489 ms returned sat
[2023-03-21 23:05:37] [INFO ] After 1583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:05:37] [INFO ] [Nat]Absence check using 451 positive place invariants in 272 ms returned sat
[2023-03-21 23:05:38] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:05:38] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-21 23:05:39] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 104 place count 951 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 950 transition count 699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 107 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 107 place count 948 transition count 698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 947 transition count 698
Applied a total of 109 rules in 113 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 947/953 places, 698/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25977 steps, run visited all 1 properties in 260 ms. (steps per millisecond=99 )
Probabilistic random walk after 25977 steps, saw 25030 distinct states, run finished after 261 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 576 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 753 ms.
Product exploration explored 100000 steps with 0 reset in 972 ms.
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 34 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:05:42] [INFO ] Invariant cache hit.
[2023-03-21 23:05:43] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-21 23:05:43] [INFO ] Invariant cache hit.
[2023-03-21 23:05:45] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 3469 ms to find 0 implicit places.
[2023-03-21 23:05:45] [INFO ] Invariant cache hit.
[2023-03-21 23:05:46] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4160 ms. Remains : 953/953 places, 702/702 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-03 finished in 29810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
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 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 79 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:05:46] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-21 23:05:47] [INFO ] Implicit Places using invariants in 650 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 651 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 42 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:05:47] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:05:48] [INFO ] Implicit Places using invariants in 1034 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 36 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:05:48] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:05:49] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-21 23:05:49] [INFO ] Invariant cache hit.
[2023-03-21 23:05:50] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3991 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s723 0), p1:(OR (EQ s443 0) (EQ s452 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 839 ms.
Product exploration explored 100000 steps with 0 reset in 998 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 441 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 271759 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 271759 steps, saw 269171 distinct states, run finished after 3004 ms. (steps per millisecond=90 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-21 23:05:56] [INFO ] Invariant cache hit.
[2023-03-21 23:05:56] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2023-03-21 23:05:57] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:05:57] [INFO ] [Nat]Absence check using 448 positive place invariants in 68 ms returned sat
[2023-03-21 23:05:58] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:05:58] [INFO ] After 826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-21 23:05:58] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Applied a total of 99 rules in 83 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260526 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260526 steps, saw 251901 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:06:01] [INFO ] Computed 448 place invariants in 5 ms
[2023-03-21 23:06:02] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2023-03-21 23:06:02] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:06:03] [INFO ] [Nat]Absence check using 448 positive place invariants in 104 ms returned sat
[2023-03-21 23:06:03] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 23:06:04] [INFO ] After 269ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:04] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-21 23:06:04] [INFO ] After 1563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 35 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 17 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:06:04] [INFO ] Invariant cache hit.
[2023-03-21 23:06:05] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-21 23:06:05] [INFO ] Invariant cache hit.
[2023-03-21 23:06:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 23:06:07] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 2784 ms to find 0 implicit places.
[2023-03-21 23:06:07] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-21 23:06:07] [INFO ] Invariant cache hit.
[2023-03-21 23:06:07] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3351 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 946 transition count 698
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 946 transition count 648
Applied a total of 100 rules in 83 ms. Remains 946 /946 variables (removed 0) and now considering 648/698 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 648 rows 946 cols
[2023-03-21 23:06:07] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-21 23:06:08] [INFO ] [Real]Absence check using 448 positive place invariants in 93 ms returned sat
[2023-03-21 23:06:08] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:06:08] [INFO ] [Nat]Absence check using 448 positive place invariants in 63 ms returned sat
[2023-03-21 23:06:09] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:09] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-21 23:06:09] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 513 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 20 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:06:10] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:06:11] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-21 23:06:11] [INFO ] Invariant cache hit.
[2023-03-21 23:06:12] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2023-03-21 23:06:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 23:06:12] [INFO ] Invariant cache hit.
[2023-03-21 23:06:13] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2556 ms. Remains : 946/946 places, 698/698 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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-21 23:06:14] [INFO ] Invariant cache hit.
[2023-03-21 23:06:14] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2023-03-21 23:06:14] [INFO ] After 784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:06:15] [INFO ] [Nat]Absence check using 448 positive place invariants in 110 ms returned sat
[2023-03-21 23:06:16] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:06:16] [INFO ] After 1003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-21 23:06:16] [INFO ] After 1546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 292 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 946 transition count 698
Applied a total of 99 rules in 50 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273139 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{0=1}
Probabilistic random walk after 273139 steps, saw 263884 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:06:20] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:06:20] [INFO ] [Real]Absence check using 448 positive place invariants in 91 ms returned sat
[2023-03-21 23:06:20] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:06:21] [INFO ] [Nat]Absence check using 448 positive place invariants in 119 ms returned sat
[2023-03-21 23:06:21] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:21] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 23:06:22] [INFO ] After 334ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:22] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-21 23:06:22] [INFO ] After 1542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276255 steps, run timeout after 3002 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276255 steps, saw 266677 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:06:25] [INFO ] Invariant cache hit.
[2023-03-21 23:06:26] [INFO ] [Real]Absence check using 448 positive place invariants in 90 ms returned sat
[2023-03-21 23:06:26] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:06:26] [INFO ] [Nat]Absence check using 448 positive place invariants in 114 ms returned sat
[2023-03-21 23:06:27] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 23:06:27] [INFO ] After 235ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:27] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-21 23:06:27] [INFO ] After 1333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 19 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:06:27] [INFO ] Invariant cache hit.
[2023-03-21 23:06:28] [INFO ] Implicit Places using invariants in 748 ms returned []
[2023-03-21 23:06:28] [INFO ] Invariant cache hit.
[2023-03-21 23:06:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-21 23:06:30] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
[2023-03-21 23:06:30] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 23:06:30] [INFO ] Invariant cache hit.
[2023-03-21 23:06:31] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3716 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 946 transition count 698
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 946 transition count 648
Applied a total of 100 rules in 73 ms. Remains 946 /946 variables (removed 0) and now considering 648/698 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 648 rows 946 cols
[2023-03-21 23:06:31] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:06:32] [INFO ] [Real]Absence check using 448 positive place invariants in 135 ms returned sat
[2023-03-21 23:06:32] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:06:33] [INFO ] [Nat]Absence check using 448 positive place invariants in 89 ms returned sat
[2023-03-21 23:06:33] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:34] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-21 23:06:34] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 574 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1024 ms.
Product exploration explored 100000 steps with 0 reset in 1115 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 18 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:06:37] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:06:37] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-21 23:06:37] [INFO ] Invariant cache hit.
[2023-03-21 23:06:39] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2023-03-21 23:06:39] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 23:06:39] [INFO ] Invariant cache hit.
[2023-03-21 23:06:39] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2615 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-04 finished in 53083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:06:39] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-21 23:06:40] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-21 23:06:40] [INFO ] Invariant cache hit.
[2023-03-21 23:06:42] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2515 ms to find 0 implicit places.
[2023-03-21 23:06:42] [INFO ] Invariant cache hit.
[2023-03-21 23:06:42] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3212 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s89 1) (EQ s95 1) (EQ s97 1)), p0:(EQ s337 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 742 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 2 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-05 finished in 4094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 21 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:06:43] [INFO ] Invariant cache hit.
[2023-03-21 23:06:44] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-21 23:06:44] [INFO ] Invariant cache hit.
[2023-03-21 23:06:45] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-21 23:06:45] [INFO ] Invariant cache hit.
[2023-03-21 23:06:46] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2683 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s632 1) (EQ s643 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-06 finished in 2852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(p0)) U p1)||G(p0)))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 37 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:06:46] [INFO ] Invariant cache hit.
[2023-03-21 23:06:47] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-21 23:06:47] [INFO ] Invariant cache hit.
[2023-03-21 23:06:48] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-21 23:06:48] [INFO ] Invariant cache hit.
[2023-03-21 23:06:49] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2600 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s449 1) (EQ s474 1) (EQ s660 1)), p0:(AND (EQ s463 1) (EQ s465 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-07 finished in 2943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 68 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:06:49] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-21 23:06:50] [INFO ] Implicit Places using invariants in 731 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 736 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 21 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:06:50] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:06:51] [INFO ] Implicit Places using invariants in 649 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 650 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 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 946 transition count 698
Applied a total of 2 rules in 27 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:06:51] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-21 23:06:51] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-21 23:06:51] [INFO ] Invariant cache hit.
[2023-03-21 23:06:52] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3312 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s282 1), p2:(AND (EQ s64 1) (EQ s66 1)), p1:(AND (EQ s897 1) (EQ s910 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 814 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-08 finished in 4450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(X(p2))))'
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 17 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:06:54] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-21 23:06:54] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-21 23:06:54] [INFO ] Invariant cache hit.
[2023-03-21 23:06:55] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2023-03-21 23:06:55] [INFO ] Invariant cache hit.
[2023-03-21 23:06:56] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2244 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=(NOT p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND p1 p0), acceptance={} source=7 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=8 dest: 4}, { cond=(NOT p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s430 1) (EQ s455 1)), p0:(EQ s379 1), p2:(AND (EQ s746 1) (EQ s757 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-09 finished in 2728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p2)&&F((p3||X(p4)))&&p1)))'
Support contains 7 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 30 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:06:56] [INFO ] Invariant cache hit.
[2023-03-21 23:06:57] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-21 23:06:57] [INFO ] Invariant cache hit.
[2023-03-21 23:06:58] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2023-03-21 23:06:58] [INFO ] Invariant cache hit.
[2023-03-21 23:06:58] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2165 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p2), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s248 1) (EQ s79 1) (EQ s96 1)), p0:(AND (EQ s234 1) (EQ s243 1)), p2:(EQ s248 1), p3:(EQ s875 1), p4:(EQ s892 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 785 ms.
Stack based approach found an accepted trace after 160 steps with 0 reset with depth 161 and stack size 161 in 2 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-10 finished in 3199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 9 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:07:00] [INFO ] Invariant cache hit.
[2023-03-21 23:07:00] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-21 23:07:00] [INFO ] Invariant cache hit.
[2023-03-21 23:07:02] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2023-03-21 23:07:02] [INFO ] Invariant cache hit.
[2023-03-21 23:07:02] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2944 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s290 1) (EQ s301 1)) (AND (EQ s711 1) (EQ s722 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 835 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-12 finished in 3953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-21 23:07:03] [INFO ] Invariant cache hit.
[2023-03-21 23:07:04] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-21 23:07:04] [INFO ] Invariant cache hit.
[2023-03-21 23:07:05] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2023-03-21 23:07:06] [INFO ] Invariant cache hit.
[2023-03-21 23:07:06] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2948 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s261 1), p0:(AND (EQ s216 1) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 818 ms.
Stack based approach found an accepted trace after 161 steps with 0 reset with depth 162 and stack size 162 in 1 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-13 finished in 4060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 42 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:07:08] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-21 23:07:08] [INFO ] Implicit Places using invariants in 707 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 711 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 27 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:07:08] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:07:09] [INFO ] Implicit Places using invariants in 612 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 626 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 34 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:07:09] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:07:10] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-21 23:07:10] [INFO ] Invariant cache hit.
[2023-03-21 23:07:11] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3686 ms. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s130 0) (EQ s391 0) (EQ s395 0) (EQ s401 0)), p1:(AND (EQ s337 1) (EQ s352 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 784 ms.
Product exploration explored 100000 steps with 0 reset in 992 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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 286 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 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Finished probabilistic random walk after 70225 steps, run visited all 2 properties in 964 ms. (steps per millisecond=72 )
Probabilistic random walk after 70225 steps, saw 69212 distinct states, run finished after 965 ms. (steps per millisecond=72 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 392 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 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 24 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:07:16] [INFO ] Invariant cache hit.
[2023-03-21 23:07:16] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-21 23:07:16] [INFO ] Invariant cache hit.
[2023-03-21 23:07:18] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2023-03-21 23:07:18] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-21 23:07:18] [INFO ] Invariant cache hit.
[2023-03-21 23:07:18] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2500 ms. Remains : 946/946 places, 698/698 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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Finished probabilistic random walk after 70225 steps, run visited all 2 properties in 876 ms. (steps per millisecond=80 )
Probabilistic random walk after 70225 steps, saw 69212 distinct states, run finished after 877 ms. (steps per millisecond=80 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 454 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 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 739 ms.
Product exploration explored 100000 steps with 0 reset in 1005 ms.
Support contains 6 out of 946 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 15 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:07:22] [INFO ] Invariant cache hit.
[2023-03-21 23:07:23] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-21 23:07:23] [INFO ] Invariant cache hit.
[2023-03-21 23:07:24] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2023-03-21 23:07:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-21 23:07:24] [INFO ] Invariant cache hit.
[2023-03-21 23:07:25] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2678 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-14 finished in 17444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X((X(!p0) U p1))))'
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 9 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2023-03-21 23:07:25] [INFO ] Computed 451 place invariants in 2 ms
[2023-03-21 23:07:26] [INFO ] Implicit Places using invariants in 696 ms returned []
[2023-03-21 23:07:26] [INFO ] Invariant cache hit.
[2023-03-21 23:07:27] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2023-03-21 23:07:27] [INFO ] Invariant cache hit.
[2023-03-21 23:07:28] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2965 ms. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s556 1) (EQ s567 1)), p0:(EQ s244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 766 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050A-LTLFireability-15 finished in 3967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-050A-LTLFireability-03
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 953/953 places, 702/702 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 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 86 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2023-03-21 23:07:30] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 23:07:31] [INFO ] Implicit Places using invariants in 853 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 867 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 949/953 places, 700/702 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 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 21 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2023-03-21 23:07:31] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:07:31] [INFO ] Implicit Places using invariants in 522 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 537 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 947/953 places, 699/702 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 946 transition count 698
Applied a total of 2 rules in 36 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:07:31] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:07:32] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-21 23:07:32] [INFO ] Invariant cache hit.
[2023-03-21 23:07:33] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 946/953 places, 698/702 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3511 ms. Remains : 946/953 places, 698/702 transitions.
Running random walk in product with property : ShieldIIPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(EQ s191 0), p0:(OR (EQ s746 0) (EQ s757 0)), p2:(OR (EQ s746 0) (EQ s757 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 808 ms.
Product exploration explored 100000 steps with 0 reset in 985 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 p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 2071 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 23:07:38] [INFO ] Invariant cache hit.
[2023-03-21 23:07:39] [INFO ] [Real]Absence check using 448 positive place invariants in 134 ms returned sat
[2023-03-21 23:07:39] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-21 23:07:40] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2023-03-21 23:07:40] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-21 23:07:41] [INFO ] After 1043ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-21 23:07:41] [INFO ] After 1563ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 322 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 946 transition count 698
Applied a total of 97 rules in 28 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 297878 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 297878 steps, saw 287251 distinct states, run finished after 3003 ms. (steps per millisecond=99 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:07:45] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:07:45] [INFO ] [Real]Absence check using 448 positive place invariants in 82 ms returned sat
[2023-03-21 23:07:45] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:07:46] [INFO ] [Nat]Absence check using 448 positive place invariants in 209 ms returned sat
[2023-03-21 23:07:46] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:07:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-21 23:07:47] [INFO ] After 191ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:07:47] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-21 23:07:47] [INFO ] After 1582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 16 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 946/946 places, 698/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 299703 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299703 steps, saw 288884 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:07:50] [INFO ] Invariant cache hit.
[2023-03-21 23:07:50] [INFO ] [Real]Absence check using 448 positive place invariants in 75 ms returned sat
[2023-03-21 23:07:51] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:07:51] [INFO ] [Nat]Absence check using 448 positive place invariants in 68 ms returned sat
[2023-03-21 23:07:52] [INFO ] After 699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:07:52] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-21 23:07:52] [INFO ] After 213ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:07:52] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-21 23:07:52] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 13 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 14 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:07:52] [INFO ] Invariant cache hit.
[2023-03-21 23:07:53] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-21 23:07:53] [INFO ] Invariant cache hit.
[2023-03-21 23:07:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-21 23:07:56] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 3592 ms to find 0 implicit places.
[2023-03-21 23:07:56] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-21 23:07:56] [INFO ] Invariant cache hit.
[2023-03-21 23:07:57] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4465 ms. Remains : 946/946 places, 698/698 transitions.
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 946 transition count 698
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 946 transition count 649
Applied a total of 98 rules in 43 ms. Remains 946 /946 variables (removed 0) and now considering 649/698 (removed 49) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 649 rows 946 cols
[2023-03-21 23:07:57] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:07:57] [INFO ] [Real]Absence check using 448 positive place invariants in 61 ms returned sat
[2023-03-21 23:07:57] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:07:58] [INFO ] [Nat]Absence check using 448 positive place invariants in 69 ms returned sat
[2023-03-21 23:07:59] [INFO ] After 899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:07:59] [INFO ] After 995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-21 23:07:59] [INFO ] After 1367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p0 p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 35 factoid took 2525 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 26 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
// Phase 1: matrix 698 rows 946 cols
[2023-03-21 23:08:02] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:08:03] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-21 23:08:03] [INFO ] Invariant cache hit.
[2023-03-21 23:08:04] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-21 23:08:04] [INFO ] Invariant cache hit.
[2023-03-21 23:08:04] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2768 ms. Remains : 946/946 places, 698/698 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 p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 440 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Finished probabilistic random walk after 32416 steps, run visited all 4 properties in 362 ms. (steps per millisecond=89 )
Probabilistic random walk after 32416 steps, saw 31684 distinct states, run finished after 363 ms. (steps per millisecond=89 ) properties seen :4
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 562 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 785 ms.
Product exploration explored 100000 steps with 0 reset in 912 ms.
Support contains 3 out of 946 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 11 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-21 23:08:09] [INFO ] Invariant cache hit.
[2023-03-21 23:08:10] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-21 23:08:10] [INFO ] Invariant cache hit.
[2023-03-21 23:08:11] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2023-03-21 23:08:11] [INFO ] Invariant cache hit.
[2023-03-21 23:08:11] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2496 ms. Remains : 946/946 places, 698/698 transitions.
Treatment of property ShieldIIPt-PT-050A-LTLFireability-03 finished in 42354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
[2023-03-21 23:08:12] [INFO ] Flatten gal took : 90 ms
[2023-03-21 23:08:12] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 23:08:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 953 places, 702 transitions and 3004 arcs took 23 ms.
Total runtime 228187 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2373/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2373/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2373/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2373/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-050A-LTLFireability-01
Could not compute solution for formula : ShieldIIPt-PT-050A-LTLFireability-03
Could not compute solution for formula : ShieldIIPt-PT-050A-LTLFireability-04
Could not compute solution for formula : ShieldIIPt-PT-050A-LTLFireability-14

BK_STOP 1679440093750

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-050A-LTLFireability-01
ltl formula formula --ltl=/tmp/2373/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 953 places, 702 transitions and 3004 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.200 real 0.060 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2373/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2373/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2373/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2373/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPt-PT-050A-LTLFireability-03
ltl formula formula --ltl=/tmp/2373/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 953 places, 702 transitions and 3004 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.120 real 0.030 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2373/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2373/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2373/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2373/ltl_1_
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), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPt-PT-050A-LTLFireability-04
ltl formula formula --ltl=/tmp/2373/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 953 places, 702 transitions and 3004 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.110 real 0.020 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2373/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2373/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2373/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2373/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldIIPt-PT-050A-LTLFireability-14
ltl formula formula --ltl=/tmp/2373/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 953 places, 702 transitions and 3004 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.130 real 0.050 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2373/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2373/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2373/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2373/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050A"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-050A, 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 r393-oct2-167903716900324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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