Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900204.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:53 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.9K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 24K 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 ShieldRVt-PT-002B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679170843782

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:20:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:20:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:20:45] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-18 20:20:45] [INFO ] Transformed 103 places.
[2023-03-18 20:20:45] [INFO ] Transformed 103 transitions.
[2023-03-18 20:20:45] [INFO ] Found NUPN structural information;
[2023-03-18 20:20:45] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-002B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 91 transition count 91
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 91 transition count 91
Applied a total of 24 rules in 15 ms. Remains 91 /103 variables (removed 12) and now considering 91/103 (removed 12) transitions.
// Phase 1: matrix 91 rows 91 cols
[2023-03-18 20:20:45] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-18 20:20:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-18 20:20:45] [INFO ] Invariant cache hit.
[2023-03-18 20:20:45] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-18 20:20:45] [INFO ] Invariant cache hit.
[2023-03-18 20:20:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 91/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 91/103 places, 91/103 transitions.
Support contains 30 out of 91 places after structural reductions.
[2023-03-18 20:20:45] [INFO ] Flatten gal took : 24 ms
[2023-03-18 20:20:45] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:20:45] [INFO ] Input system was already deterministic with 91 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:20:45] [INFO ] Invariant cache hit.
[2023-03-18 20:20:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 20:20:45] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 4 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-18 20:20:46] [INFO ] After 117ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:20:46] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:20:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-18 20:20:46] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-18 20:20:46] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 20:20:46] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 91/91 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 67
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 67 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 66 transition count 66
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 50 place count 66 transition count 55
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 55 transition count 55
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 49 transition count 49
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 49 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 84 place count 49 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 92 place count 45 transition count 45
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 128 place count 27 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 27 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 26 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 139 place count 22 transition count 27
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 22 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 20 transition count 25
Applied a total of 142 rules in 14 ms. Remains 20 /91 variables (removed 71) and now considering 25/91 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 20/91 places, 25/91 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 514 states, properties seen :0
Probabilistic random walk after 2692 steps, saw 514 distinct states, run finished after 13 ms. (steps per millisecond=207 ) properties seen :0
Explored full state space saw : 514 states, properties seen :0
Exhaustive walk after 2692 steps, saw 514 distinct states, run finished after 4 ms. (steps per millisecond=673 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA ShieldRVt-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 28 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' '!(X((p0||X(G((p1&&X(p0)))))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 8 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:46] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:20:46] [INFO ] Invariant cache hit.
[2023-03-18 20:20:46] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-18 20:20:46] [INFO ] Invariant cache hit.
[2023-03-18 20:20:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s17 0), p1:(EQ s77 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/80 stabilizing places and 23/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-00 finished in 785 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)))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 90 transition count 64
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 64 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 63 transition count 63
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 54 place count 63 transition count 53
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 74 place count 53 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 46 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 46 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 88 place count 46 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 41 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 126 place count 27 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 27 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 26 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 139 place count 21 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 18 transition count 27
Applied a total of 142 rules in 25 ms. Remains 18 /91 variables (removed 73) and now considering 27/91 (removed 64) transitions.
// Phase 1: matrix 27 rows 18 cols
[2023-03-18 20:20:47] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-18 20:20:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 20:20:47] [INFO ] Invariant cache hit.
[2023-03-18 20:20:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 20:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:20:47] [INFO ] Invariant cache hit.
[2023-03-18 20:20:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/91 places, 27/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 18/91 places, 27/91 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-01 finished in 195 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(F(p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Applied a total of 20 rules in 9 ms. Remains 81 /91 variables (removed 10) and now considering 81/91 (removed 10) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-18 20:20:47] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:20:47] [INFO ] Invariant cache hit.
[2023-03-18 20:20:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 20:20:47] [INFO ] Invariant cache hit.
[2023-03-18 20:20:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/91 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 81/91 places, 81/91 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s52 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-02 finished in 604 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(F((p0&&G(F(p1))))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 81 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 79 transition count 79
Applied a total of 24 rules in 13 ms. Remains 79 /91 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 79 cols
[2023-03-18 20:20:48] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-18 20:20:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 20:20:48] [INFO ] Invariant cache hit.
[2023-03-18 20:20:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-18 20:20:48] [INFO ] Invariant cache hit.
[2023-03-18 20:20:48] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/91 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 79/91 places, 79/91 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s57 1), p0:(NEQ s32 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 694 reset in 145 ms.
Product exploration explored 100000 steps with 669 reset in 207 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 79 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 : 79/79 places, 79/79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 78 transition count 59
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 59 transition count 59
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 38 place count 59 transition count 44
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 68 place count 44 transition count 44
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 28 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 28 transition count 27
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 3 with 2 rules applied. Total rules applied 103 place count 27 transition count 26
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 23 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 23 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 20 transition count 26
Applied a total of 115 rules in 26 ms. Remains 20 /79 variables (removed 59) and now considering 26/79 (removed 53) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-18 20:20:49] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-18 20:20:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:20:49] [INFO ] Invariant cache hit.
[2023-03-18 20:20:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-18 20:20:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:20:49] [INFO ] Invariant cache hit.
[2023-03-18 20:20:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/79 places, 26/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 20/79 places, 26/79 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-03 finished in 2253 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||(p1&&X((p2||F(p3))))) U (G((p0||(p1&&X((p2||F(p3))))))||((p0||(p1&&X((p2||F(p3)))))&&G(p2))))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Applied a total of 18 rules in 3 ms. Remains 82 /91 variables (removed 9) and now considering 82/91 (removed 9) transitions.
// Phase 1: matrix 82 rows 82 cols
[2023-03-18 20:20:50] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-18 20:20:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 20:20:50] [INFO ] Invariant cache hit.
[2023-03-18 20:20:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 20:20:50] [INFO ] Invariant cache hit.
[2023-03-18 20:20:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/91 places, 82/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 82/91 places, 82/91 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s61 1), p0:(EQ s7 1), p1:(NEQ s50 1), p3:(NEQ s45 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32667 reset in 156 ms.
Product exploration explored 100000 steps with 32672 reset in 186 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/82 stabilizing places and 24/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3)))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1274 ms. Reduced automaton from 5 states, 22 edges and 4 AP (stutter sensitive) to 6 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:20:52] [INFO ] Invariant cache hit.
[2023-03-18 20:20:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 20:20:52] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-18 20:20:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 20:20:52] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3)))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p3) p0))), (G (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (NOT (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p2 (NOT p3) p0) (AND p2 (NOT p3) p1)))]
Knowledge based reduction with 29 factoid took 1556 ms. Reduced automaton from 6 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 82 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 : 82/82 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 81 transition count 62
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 61 transition count 61
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 40 place count 61 transition count 45
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 72 place count 45 transition count 45
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 32 transition count 32
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 26 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 25 transition count 37
Applied a total of 111 rules in 11 ms. Remains 25 /82 variables (removed 57) and now considering 37/82 (removed 45) transitions.
// Phase 1: matrix 37 rows 25 cols
[2023-03-18 20:20:54] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 20:20:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:20:54] [INFO ] Invariant cache hit.
[2023-03-18 20:20:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:20:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 20:20:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:20:54] [INFO ] Invariant cache hit.
[2023-03-18 20:20:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/82 places, 37/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 25/82 places, 37/82 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/25 stabilizing places and 4/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 411 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 402 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 456 steps with 2 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-05 finished in 5519 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(G((X(p0) U p1)))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 4 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:20:55] [INFO ] Invariant cache hit.
[2023-03-18 20:20:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-18 20:20:55] [INFO ] Invariant cache hit.
[2023-03-18 20:20:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s14 1), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7483 steps with 8 reset in 6 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-06 finished in 192 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(p0) U (p1&&G(p0)))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 4 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:56] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s71 1), p1:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-07 finished in 262 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 U X(p1))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 5 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (EQ s70 1) (EQ s79 1)), p1:(EQ s63 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-08 finished in 304 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||X(G(p1))))&&(p2 U p3)))))'
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 3 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-18 20:20:56] [INFO ] Invariant cache hit.
[2023-03-18 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (OR (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p3), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p3:(EQ s76 1), p2:(AND (EQ s2 1) (EQ s29 1)), p1:(AND (EQ s39 0) (EQ s76 0)), p0:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][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 ShieldRVt-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-09 finished in 362 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(p0)))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 3 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:20:57] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s72 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-10 finished in 216 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||(p1 U (G(p1)||(p1&&G(p2)))))))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Applied a total of 20 rules in 3 ms. Remains 81 /91 variables (removed 10) and now considering 81/91 (removed 10) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-18 20:20:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/91 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 81/91 places, 81/91 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s38 0), p2:(NEQ s79 1), p1:(NEQ s38 1)], nbAcceptance=2, 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 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 p1)
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-11 finished in 616 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) U G(p1)))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 81 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 79 transition count 79
Applied a total of 24 rules in 2 ms. Remains 79 /91 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 79 cols
[2023-03-18 20:20:57] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 20:20:57] [INFO ] Invariant cache hit.
[2023-03-18 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/91 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 79/91 places, 79/91 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s0 1), p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 48 reset in 85 ms.
Product exploration explored 100000 steps with 40 reset in 165 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/79 stabilizing places and 22/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), true, (AND p0 p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:20:58] [INFO ] Invariant cache hit.
[2023-03-18 20:20:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 20:20:58] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
[2023-03-18 20:20:59] [INFO ] Invariant cache hit.
[2023-03-18 20:20:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 20:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:20:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-18 20:20:59] [INFO ] Computed and/alt/rep : 78/115/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 20:20:59] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 79/79 transitions.
Applied a total of 0 rules in 0 ms. Remains 79 /79 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-18 20:20:59] [INFO ] Invariant cache hit.
[2023-03-18 20:20:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:20:59] [INFO ] Invariant cache hit.
[2023-03-18 20:20:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 20:20:59] [INFO ] Invariant cache hit.
[2023-03-18 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 79/79 places, 79/79 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/79 stabilizing places and 22/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Finished random walk after 103 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
[2023-03-18 20:21:00] [INFO ] Invariant cache hit.
[2023-03-18 20:21:00] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-18 20:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:21:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-18 20:21:00] [INFO ] Computed and/alt/rep : 78/115/78 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 20:21:00] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Product exploration explored 100000 steps with 34 reset in 99 ms.
Product exploration explored 100000 steps with 35 reset in 123 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 79/79 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 79 transition count 79
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 20 place count 79 transition count 87
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 79 transition count 87
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 79 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 79 transition count 86
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 68 place count 64 transition count 71
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 83 place count 64 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 64 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 62 transition count 69
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 62 transition count 69
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 62 transition count 101
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 56 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 56 transition count 89
Deduced a syphon composed of 36 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 56 transition count 86
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 109 rules in 25 ms. Remains 56 /79 variables (removed 23) and now considering 86/79 (removed -7) transitions.
[2023-03-18 20:21:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 86 rows 56 cols
[2023-03-18 20:21:01] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:21:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/79 places, 86/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 56/79 places, 86/79 transitions.
Built C files in :
/tmp/ltsmin1691763550372787740
[2023-03-18 20:21:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1691763550372787740
Running compilation step : cd /tmp/ltsmin1691763550372787740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin1691763550372787740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1691763550372787740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6827037374649066133.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 79 cols
[2023-03-18 20:21:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:21:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:21:16] [INFO ] Invariant cache hit.
[2023-03-18 20:21:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-18 20:21:16] [INFO ] Invariant cache hit.
[2023-03-18 20:21:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 79/79 places, 79/79 transitions.
Built C files in :
/tmp/ltsmin6439739702432898294
[2023-03-18 20:21:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6439739702432898294
Running compilation step : cd /tmp/ltsmin6439739702432898294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin6439739702432898294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6439739702432898294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6675508380715926029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:21:32] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:21:32] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:21:32] [INFO ] Time to serialize gal into /tmp/LTL15736247880396264739.gal : 1 ms
[2023-03-18 20:21:32] [INFO ] Time to serialize properties into /tmp/LTL6840162744981233657.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15736247880396264739.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1964131718949769378.hoa' '-atoms' '/tmp/LTL6840162744981233657.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6840162744981233657.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1964131718949769378.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t14, t21, t26, t30, t35, t38, t44, t51, t56, t60, t69, t72, t77, t80, t85, Intersect...243
Computing Next relation with stutter on 8 deadlock states
33 unique states visited
0 strongly connected components in search stack
63 transitions explored
33 items max in DFS search stack
146 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.47871,75684,1,0,587,261132,189,573,2164,485248,1289
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-002B-LTLFireability-12 finished in 36006 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&&G(p1))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Applied a total of 22 rules in 8 ms. Remains 80 /91 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 80 cols
[2023-03-18 20:21:33] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 80/91 places, 80/91 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s65 0), p0:(NEQ s45 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-15 finished in 306 ms.
All properties solved by simple procedures.
Total runtime 49028 ms.

BK_STOP 1679170894303

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVt-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-002B, 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 r421-tajo-167905974900204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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