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-167905974700028.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 ShieldRVs-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-167905974700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 ShieldRVs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679159693717

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=ShieldRVs-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 17:14:55] [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 17:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:14:55] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-18 17:14:55] [INFO ] Transformed 83 places.
[2023-03-18 17:14:55] [INFO ] Transformed 93 transitions.
[2023-03-18 17:14:55] [INFO ] Found NUPN structural information;
[2023-03-18 17:14:55] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-002B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 88
Applied a total of 10 rules in 29 ms. Remains 78 /83 variables (removed 5) and now considering 88/93 (removed 5) transitions.
// Phase 1: matrix 88 rows 78 cols
[2023-03-18 17:14:55] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-18 17:14:55] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-18 17:14:55] [INFO ] Invariant cache hit.
[2023-03-18 17:14:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-18 17:14:56] [INFO ] Invariant cache hit.
[2023-03-18 17:14:56] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 88/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 78/83 places, 88/93 transitions.
Support contains 44 out of 78 places after structural reductions.
[2023-03-18 17:14:56] [INFO ] Flatten gal took : 50 ms
[2023-03-18 17:14:56] [INFO ] Flatten gal took : 18 ms
[2023-03-18 17:14:56] [INFO ] Input system was already deterministic with 88 transitions.
Support contains 41 out of 78 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 35) seen :33
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 17:14:56] [INFO ] Invariant cache hit.
[2023-03-18 17:14:57] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2023-03-18 17:14:57] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 23 stabilizing places and 23 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' '!((p0 U X(p1)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 8 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:14:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:14:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 17:14:57] [INFO ] Invariant cache hit.
[2023-03-18 17:14:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-18 17:14:58] [INFO ] Invariant cache hit.
[2023-03-18 17:14:58] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-00 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 70 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 61 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 51 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 51 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 52 place count 51 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 46 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 33 transition count 43
Applied a total of 86 rules in 24 ms. Remains 33 /78 variables (removed 45) and now considering 43/88 (removed 45) transitions.
// Phase 1: matrix 43 rows 33 cols
[2023-03-18 17:14:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:14:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 17:14:58] [INFO ] Invariant cache hit.
[2023-03-18 17:14:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-18 17:14:58] [INFO ] Redundant transitions in 33 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 42 rows 33 cols
[2023-03-18 17:14:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:14:58] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/78 places, 42/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 33/78 places, 42/88 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1), p1:(OR (AND (EQ s3 1) (EQ s20 1) (EQ s32 1)) (AND (EQ s23 1) (EQ s29 1)))], nbAcceptance=2, 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 66 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-01 finished in 310 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(p0)||(p1 U (G(p1)||(p1&&G((p2 U p3))))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 4 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:14:58] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-18 17:14:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 17:14:58] [INFO ] Invariant cache hit.
[2023-03-18 17:14:58] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 17:14:58] [INFO ] Invariant cache hit.
[2023-03-18 17:14:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 485 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(OR p3 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s68 1), p3:(EQ s52 1), p2:(AND (EQ s2 1) (EQ s22 1)), p0:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/69 stabilizing places and 15/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT (OR (AND p3 p1) (AND p2 p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0)))))), (X (X (NOT (OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 12 factoid took 253 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-02 finished in 1323 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)&&F(p2)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 5 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:15:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 17:15:00] [INFO ] Invariant cache hit.
[2023-03-18 17:15:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 17:15:00] [INFO ] Invariant cache hit.
[2023-03-18 17:15:00] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s24 0) (EQ s33 0) (EQ s54 0)), p2:(EQ s41 0), p0:(EQ s5 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X (AND p1 p2))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 10 factoid took 158 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-03 finished in 741 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))) U (p1||(p2&&X(X(X(p3)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-18 17:15:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 17:15:00] [INFO ] Invariant cache hit.
[2023-03-18 17:15:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-18 17:15:00] [INFO ] Invariant cache hit.
[2023-03-18 17:15:01] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 701 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=8 dest: 3}], [{ cond=(NOT p3), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 9}], [{ cond=(NOT p3), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s16 1), p2:(OR (EQ s17 1) (EQ s19 1)), p0:(EQ s60 1), p3:(EQ s17 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5265 reset in 139 ms.
Product exploration explored 100000 steps with 5229 reset in 105 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 567 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Finished random walk after 55 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p3) p0)), (F p3)]
Knowledge based reduction with 8 factoid took 526 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 537 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Stuttering acceptance computed with spot in 517 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
[2023-03-18 17:15:04] [INFO ] Invariant cache hit.
[2023-03-18 17:15:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:04] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 17:15:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:04] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-18 17:15:04] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 17:15:05] [INFO ] Added : 79 causal constraints over 17 iterations in 274 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2023-03-18 17:15:05] [INFO ] Invariant cache hit.
[2023-03-18 17:15:05] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:05] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-18 17:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-18 17:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:05] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-18 17:15:05] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 17:15:05] [INFO ] Added : 79 causal constraints over 16 iterations in 199 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-18 17:15:05] [INFO ] Invariant cache hit.
[2023-03-18 17:15:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 17:15:05] [INFO ] Invariant cache hit.
[2023-03-18 17:15:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-18 17:15:05] [INFO ] Invariant cache hit.
[2023-03-18 17:15:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 70/70 places, 80/80 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 519 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Finished random walk after 442 steps, including 3 resets, run visited all 9 properties in 9 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p3) p0)), (F p3)]
Knowledge based reduction with 8 factoid took 567 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Stuttering acceptance computed with spot in 587 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
[2023-03-18 17:15:08] [INFO ] Invariant cache hit.
[2023-03-18 17:15:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-18 17:15:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-18 17:15:08] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 17:15:08] [INFO ] Added : 79 causal constraints over 17 iterations in 127 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2023-03-18 17:15:08] [INFO ] Invariant cache hit.
[2023-03-18 17:15:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 17:15:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-18 17:15:08] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 17:15:09] [INFO ] Added : 79 causal constraints over 16 iterations in 121 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 722 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Product exploration explored 100000 steps with 5271 reset in 113 ms.
Product exploration explored 100000 steps with 5233 reset in 176 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 551 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 70 transition count 81
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 70 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 69 transition count 80
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 69 transition count 80
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 59 transition count 70
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 59 transition count 70
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 55 rules in 11 ms. Remains 59 /70 variables (removed 11) and now considering 70/80 (removed 10) transitions.
[2023-03-18 17:15:10] [INFO ] Redundant transitions in 18 ms returned [69]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-18 17:15:10] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 17:15:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/70 places, 69/80 transitions.
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 59/70 places, 69/80 transitions.
Built C files in :
/tmp/ltsmin9504907736485290372
[2023-03-18 17:15:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9504907736485290372
Running compilation step : cd /tmp/ltsmin9504907736485290372;'/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 259 ms.
Running link step : cd /tmp/ltsmin9504907736485290372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9504907736485290372;'/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/stateBased8524137105160985839.hoa' '--buchi-type=spotba'
LTSmin run took 6867 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-002B-LTLFireability-04 finished in 17274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||F(p2))))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 6 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-18 17:15:18] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 17:15:18] [INFO ] Invariant cache hit.
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-18 17:15:18] [INFO ] Invariant cache hit.
[2023-03-18 17:15:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s21 0), p1:(EQ s35 1), p2:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-05 finished in 283 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 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 79
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 69 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 49 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 56 place count 49 transition count 53
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 43 transition count 53
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 30 transition count 40
Applied a total of 92 rules in 15 ms. Remains 30 /78 variables (removed 48) and now considering 40/88 (removed 48) transitions.
// Phase 1: matrix 40 rows 30 cols
[2023-03-18 17:15:18] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 17:15:18] [INFO ] Invariant cache hit.
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-18 17:15:18] [INFO ] Redundant transitions in 14 ms returned [39]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 39 rows 30 cols
[2023-03-18 17:15:18] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 17:15:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/78 places, 39/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 30/78 places, 39/88 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s18 1) (NEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2716 reset in 160 ms.
Stack based approach found an accepted trace after 7110 steps with 196 reset with depth 15 and stack size 15 in 14 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-06 finished in 353 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)||X(X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 2 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:15:18] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 17:15:18] [INFO ] Invariant cache hit.
[2023-03-18 17:15:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-18 17:15:18] [INFO ] Invariant cache hit.
[2023-03-18 17:15:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s14 1) (EQ s18 1) (EQ s25 1)), p2:(NEQ s32 1), p1:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1996 steps with 18 reset in 3 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-07 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U X(X(p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 2 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:15:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 17:15:19] [INFO ] Invariant cache hit.
[2023-03-18 17:15:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 17:15:19] [INFO ] Invariant cache hit.
[2023-03-18 17:15:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={} source=9 dest: 2}], [{ cond=(NOT p1), acceptance={} source=10 dest: 11}, { cond=p1, acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 2}], [{ cond=(NOT p1), acceptance={} source=12 dest: 11}]], initial=3, aps=[p0:(EQ s59 1), p1:(AND (EQ s15 1) (EQ s18 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-10 finished in 545 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(p1)||p0)))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 1 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:15:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 17:15:19] [INFO ] Invariant cache hit.
[2023-03-18 17:15:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-18 17:15:19] [INFO ] Invariant cache hit.
[2023-03-18 17:15:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-11 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=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s59 1), p0:(OR (EQ s11 0) (EQ s46 0) (EQ s66 0) (EQ s60 1))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-11 finished in 507 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((F(p0)&&(p1||X(p2)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 1 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-18 17:15:20] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 17:15:20] [INFO ] Invariant cache hit.
[2023-03-18 17:15:20] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 17:15:20] [INFO ] Invariant cache hit.
[2023-03-18 17:15:20] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s36 0), p1:(EQ s37 1), p2:(EQ s37 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-12 finished in 777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((F(p0)||X(F(p1))) U G(p2)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 3 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-18 17:15:21] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-18 17:15:21] [INFO ] Invariant cache hit.
[2023-03-18 17:15:21] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-18 17:15:21] [INFO ] Invariant cache hit.
[2023-03-18 17:15:21] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s21 1), p2:(EQ s60 1), p1:(AND (EQ s4 1) (EQ s15 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2264 reset in 129 ms.
Product exploration explored 100000 steps with 2273 reset in 133 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 406 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
[2023-03-18 17:15:23] [INFO ] Invariant cache hit.
[2023-03-18 17:15:23] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 17:15:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-18 17:15:23] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 19 ms to minimize.
[2023-03-18 17:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-18 17:15:23] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-18 17:15:23] [INFO ] Added : 75 causal constraints over 16 iterations in 180 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-18 17:15:23] [INFO ] Invariant cache hit.
[2023-03-18 17:15:24] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2023-03-18 17:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:25] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2023-03-18 17:15:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-18 17:15:25] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-18 17:15:25] [INFO ] Added : 61 causal constraints over 13 iterations in 89 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-18 17:15:25] [INFO ] Invariant cache hit.
[2023-03-18 17:15:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 17:15:25] [INFO ] Invariant cache hit.
[2023-03-18 17:15:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-18 17:15:25] [INFO ] Invariant cache hit.
[2023-03-18 17:15:26] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 70/70 places, 80/80 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 476 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
[2023-03-18 17:15:27] [INFO ] Invariant cache hit.
[2023-03-18 17:15:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-18 17:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:27] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-18 17:15:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 78 ms returned sat
[2023-03-18 17:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:28] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2023-03-18 17:15:28] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-18 17:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-18 17:15:28] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-18 17:15:29] [INFO ] Added : 75 causal constraints over 16 iterations in 533 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-18 17:15:29] [INFO ] Invariant cache hit.
[2023-03-18 17:15:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:29] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-18 17:15:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:15:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 17:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:15:29] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 17:15:29] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 17:15:29] [INFO ] Added : 61 causal constraints over 13 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2270 reset in 102 ms.
Product exploration explored 100000 steps with 2279 reset in 104 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 70 transition count 82
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 70 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 69 transition count 81
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 69 transition count 81
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 38 place count 69 transition count 81
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 58 transition count 70
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 58 transition count 70
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 60 rules in 15 ms. Remains 58 /70 variables (removed 12) and now considering 70/80 (removed 10) transitions.
[2023-03-18 17:15:30] [INFO ] Redundant transitions in 29 ms returned [69]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 58 cols
[2023-03-18 17:15:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/70 places, 69/80 transitions.
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 58/70 places, 69/80 transitions.
Built C files in :
/tmp/ltsmin6893721455495660232
[2023-03-18 17:15:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6893721455495660232
Running compilation step : cd /tmp/ltsmin6893721455495660232;'/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 196 ms.
Running link step : cd /tmp/ltsmin6893721455495660232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6893721455495660232;'/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/stateBased13994764109340724854.hoa' '--buchi-type=spotba'
LTSmin run took 2445 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-002B-LTLFireability-14 finished in 11843 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)) U G((F(p1)||G(p2)))))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 80
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 70 transition count 69
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 59 transition count 69
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 50 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 50 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 54 place count 50 transition count 56
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 46 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 33 transition count 43
Applied a total of 86 rules in 13 ms. Remains 33 /78 variables (removed 45) and now considering 43/88 (removed 45) transitions.
// Phase 1: matrix 43 rows 33 cols
[2023-03-18 17:15:32] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-18 17:15:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 17:15:32] [INFO ] Invariant cache hit.
[2023-03-18 17:15:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 17:15:33] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 17:15:33] [INFO ] Invariant cache hit.
[2023-03-18 17:15:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/78 places, 43/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 33/78 places, 43/88 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s16 1) (EQ s25 1)), p2:(AND (EQ s21 1) (EQ s23 1) (EQ s28 1)), p0:(NEQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2918 reset in 105 ms.
Stack based approach found an accepted trace after 237 steps with 7 reset with depth 55 and stack size 55 in 1 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-15 finished in 445 ms.
All properties solved by simple procedures.
Total runtime 37875 ms.

BK_STOP 1679159733584

--------------------
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="ShieldRVs-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 ShieldRVs-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-167905974700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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