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.r425-tajo-167905978000308.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 ltsminxred
Input is ShieldRVt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.3K Feb 26 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 23:27 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.5K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 00:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 00:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 109K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679309837492

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:57:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:57:20] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-20 10:57:20] [INFO ] Transformed 323 places.
[2023-03-20 10:57:20] [INFO ] Transformed 323 transitions.
[2023-03-20 10:57:20] [INFO ] Found NUPN structural information;
[2023-03-20 10:57:20] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 217 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 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 63 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:57:20] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-20 10:57:20] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-20 10:57:20] [INFO ] Invariant cache hit.
[2023-03-20 10:57:21] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-20 10:57:21] [INFO ] Invariant cache hit.
[2023-03-20 10:57:21] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1390 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 57 out of 323 places after structural reductions.
[2023-03-20 10:57:22] [INFO ] Flatten gal took : 113 ms
[2023-03-20 10:57:22] [INFO ] Flatten gal took : 61 ms
[2023-03-20 10:57:22] [INFO ] Input system was already deterministic with 322 transitions.
Support contains 56 out of 323 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-20 10:57:23] [INFO ] Invariant cache hit.
[2023-03-20 10:57:23] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2023-03-20 10:57:24] [INFO ] After 1021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 10:57:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 78 ms returned sat
[2023-03-20 10:57:26] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 10:57:26] [INFO ] After 904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 774 ms.
[2023-03-20 10:57:27] [INFO ] After 2535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 591 ms.
Support contains 19 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 40 place count 322 transition count 321
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 78 place count 322 transition count 283
Applied a total of 78 rules in 94 ms. Remains 322 /323 variables (removed 1) and now considering 283/322 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 322/323 places, 283/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 283 rows 322 cols
[2023-03-20 10:57:29] [INFO ] Computed 161 place invariants in 10 ms
[2023-03-20 10:57:29] [INFO ] [Real]Absence check using 161 positive place invariants in 34 ms returned sat
[2023-03-20 10:57:30] [INFO ] After 1728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 10:57:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 37 ms returned sat
[2023-03-20 10:57:31] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 10:57:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 10:57:31] [INFO ] After 202ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 10:57:31] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-20 10:57:32] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 268 ms.
Support contains 9 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 283/283 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 283
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 322 transition count 282
Applied a total of 2 rules in 33 ms. Remains 322 /322 variables (removed 0) and now considering 282/283 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 322/322 places, 282/283 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Finished probabilistic random walk after 4388 steps, run visited all 8 properties in 174 ms. (steps per millisecond=25 )
Probabilistic random walk after 4388 steps, saw 4274 distinct states, run finished after 177 ms. (steps per millisecond=24 ) properties seen :8
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:57:34] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:57:34] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-20 10:57:34] [INFO ] Invariant cache hit.
[2023-03-20 10:57:35] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-20 10:57:35] [INFO ] Invariant cache hit.
[2023-03-20 10:57:35] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1159 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 454 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s280 0) (EQ s282 0) (EQ s287 0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 208 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 1697 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 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:36] [INFO ] Invariant cache hit.
[2023-03-20 10:57:36] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-20 10:57:36] [INFO ] Invariant cache hit.
[2023-03-20 10:57:36] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-20 10:57:36] [INFO ] Invariant cache hit.
[2023-03-20 10:57:37] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1060 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01 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:(AND (EQ s180 1) (EQ s181 1) (EQ s184 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-040A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 1149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:37] [INFO ] Invariant cache hit.
[2023-03-20 10:57:37] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-20 10:57:37] [INFO ] Invariant cache hit.
[2023-03-20 10:57:37] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-20 10:57:37] [INFO ] Invariant cache hit.
[2023-03-20 10:57:38] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s319 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 963 ms.
Product exploration explored 100000 steps with 33333 reset in 1162 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 3257 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)&&F(p1)))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:40] [INFO ] Invariant cache hit.
[2023-03-20 10:57:45] [INFO ] Implicit Places using invariants in 4947 ms returned []
[2023-03-20 10:57:45] [INFO ] Invariant cache hit.
[2023-03-20 10:57:45] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 5354 ms to find 0 implicit places.
[2023-03-20 10:57:45] [INFO ] Invariant cache hit.
[2023-03-20 10:57:46] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5577 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s39 1), p0:(EQ s113 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 0 reset in 505 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 6441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p1&&G(p2)))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:46] [INFO ] Invariant cache hit.
[2023-03-20 10:57:47] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-20 10:57:47] [INFO ] Invariant cache hit.
[2023-03-20 10:57:47] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-20 10:57:47] [INFO ] Invariant cache hit.
[2023-03-20 10:57:47] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s75 0), p1:(EQ s163 0), p2:(OR (EQ s16 0) (EQ s18 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 559 ms.
Product exploration explored 100000 steps with 0 reset in 1104 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 708 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Finished probabilistic random walk after 4609 steps, run visited all 7 properties in 151 ms. (steps per millisecond=30 )
Probabilistic random walk after 4609 steps, saw 4462 distinct states, run finished after 151 ms. (steps per millisecond=30 ) properties seen :7
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 796 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:53] [INFO ] Invariant cache hit.
[2023-03-20 10:57:53] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-20 10:57:53] [INFO ] Invariant cache hit.
[2023-03-20 10:57:53] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-20 10:57:53] [INFO ] Invariant cache hit.
[2023-03-20 10:57:54] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 323/323 places, 322/322 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 518 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Finished probabilistic random walk after 4609 steps, run visited all 7 properties in 112 ms. (steps per millisecond=41 )
Probabilistic random walk after 4609 steps, saw 4462 distinct states, run finished after 113 ms. (steps per millisecond=40 ) properties seen :7
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 575 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 554 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:58] [INFO ] Invariant cache hit.
[2023-03-20 10:57:58] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-20 10:57:58] [INFO ] Invariant cache hit.
[2023-03-20 10:57:58] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-20 10:57:58] [INFO ] Invariant cache hit.
[2023-03-20 10:57:59] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 323/323 places, 322/322 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 12514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:57:59] [INFO ] Invariant cache hit.
[2023-03-20 10:57:59] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-20 10:57:59] [INFO ] Invariant cache hit.
[2023-03-20 10:58:00] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-20 10:58:00] [INFO ] Invariant cache hit.
[2023-03-20 10:58:00] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 998 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 808 ms.
Product exploration explored 100000 steps with 33333 reset in 757 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLFireability-05 finished in 2816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((F(!p0) U G(p1)))))'
Support contains 1 out of 323 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 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 26 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2023-03-20 10:58:02] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 10:58:02] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 10:58:02] [INFO ] Invariant cache hit.
[2023-03-20 10:58:02] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2023-03-20 10:58:02] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 10:58:02] [INFO ] Invariant cache hit.
[2023-03-20 10:58:03] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 822 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s64 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 0 reset in 419 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-06 finished in 1337 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 p1) U p2)))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:58:03] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 10:58:03] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 10:58:03] [INFO ] Invariant cache hit.
[2023-03-20 10:58:04] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-20 10:58:04] [INFO ] Invariant cache hit.
[2023-03-20 10:58:04] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s57 1), p1:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p0:(EQ s299 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 1262 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(!p0))) U ((G(p1)&&F(p2)) U p3)))'
Support contains 9 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:58:04] [INFO ] Invariant cache hit.
[2023-03-20 10:58:05] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-20 10:58:05] [INFO ] Invariant cache hit.
[2023-03-20 10:58:05] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-20 10:58:05] [INFO ] Invariant cache hit.
[2023-03-20 10:58:05] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 556 ms :[(NOT p3), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p2) p0), (AND p0 p1 (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p3) p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) p1), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p3:(EQ s241 1), p1:(AND (EQ s190 1) (EQ s193 1)), p0:(AND (EQ s212 1) (EQ s213 1) (EQ s216 1)), p2:(AND (EQ s276 1) (EQ s277 1) (EQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49970 steps with 0 reset in 224 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 1673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((X(!p1) U (p0&&X(!p1))))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:58:06] [INFO ] Invariant cache hit.
[2023-03-20 10:58:06] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-20 10:58:06] [INFO ] Invariant cache hit.
[2023-03-20 10:58:07] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-20 10:58:07] [INFO ] Invariant cache hit.
[2023-03-20 10:58:07] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s105 1), p1:(AND (EQ s230 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19900 reset in 683 ms.
Stack based approach found an accepted trace after 66 steps with 12 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 1553 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((G(F(p0)) U !p0))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 19 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2023-03-20 10:58:08] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 10:58:08] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-20 10:58:08] [INFO ] Invariant cache hit.
[2023-03-20 10:58:08] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-20 10:58:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 10:58:08] [INFO ] Invariant cache hit.
[2023-03-20 10:58:08] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 4 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-10 finished in 1272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||F(G(p2)))))))'
Support contains 12 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:58:09] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:58:09] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-20 10:58:09] [INFO ] Invariant cache hit.
[2023-03-20 10:58:09] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-20 10:58:09] [INFO ] Invariant cache hit.
[2023-03-20 10:58:10] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s251 1) (EQ s260 1) (EQ s266 1)), p1:(AND (EQ s196 1) (EQ s197 1) (EQ s200 1)), p2:(AND (OR (EQ s275 0) (EQ s284 0) (EQ s290 0)) (OR (EQ s144 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 3643 steps with 0 reset with depth 3644 and stack size 1283 in 17 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-11 finished in 1416 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 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 22 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2023-03-20 10:58:10] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:58:11] [INFO ] Implicit Places using invariants in 193 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 16 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-12 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 (EQ s54 0) (EQ s57 0))], 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 0 reset in 416 ms.
Product exploration explored 100000 steps with 0 reset in 544 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3528 steps, run visited all 1 properties in 25 ms. (steps per millisecond=141 )
Probabilistic random walk after 3528 steps, saw 3396 distinct states, run finished after 26 ms. (steps per millisecond=135 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2023-03-20 10:58:12] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 10:58:12] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-20 10:58:12] [INFO ] Invariant cache hit.
[2023-03-20 10:58:13] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-20 10:58:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 10:58:13] [INFO ] Invariant cache hit.
[2023-03-20 10:58:13] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3528 steps, run visited all 1 properties in 21 ms. (steps per millisecond=168 )
Probabilistic random walk after 3528 steps, saw 3396 distinct states, run finished after 22 ms. (steps per millisecond=160 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Product exploration explored 100000 steps with 0 reset in 575 ms.
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2023-03-20 10:58:15] [INFO ] Invariant cache hit.
[2023-03-20 10:58:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-20 10:58:15] [INFO ] Invariant cache hit.
[2023-03-20 10:58:15] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-20 10:58:15] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 10:58:15] [INFO ] Invariant cache hit.
[2023-03-20 10:58:15] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 788 ms. Remains : 321/321 places, 321/321 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-12 finished in 5149 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)||F(p1)))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 13 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2023-03-20 10:58:15] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:58:16] [INFO ] Implicit Places using invariants in 159 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s222 1) (EQ s225 1)), p0:(OR (EQ s252 0) (EQ s253 0) (EQ s256 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 419 ms.
Stack based approach found an accepted trace after 1907 steps with 1 reset with depth 975 and stack size 462 in 12 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 762 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)||G((p1&&X((p2&&G(p3)&&(p1 U (p4||G(p1)))))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:58:16] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-20 10:58:16] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-20 10:58:17] [INFO ] Invariant cache hit.
[2023-03-20 10:58:17] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-20 10:58:17] [INFO ] Invariant cache hit.
[2023-03-20 10:58:17] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s168 1) (EQ s170 1) (EQ s175 1)), p1:(NEQ s17 1), p2:(EQ s0 0), p3:(EQ s17 0)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/323 stabilizing places and 1/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (AND p1 p2 p3)), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 581 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (AND p1 p2 p3)), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 p2 p3))]
Knowledge based reduction with 17 factoid took 842 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 89 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
[2023-03-20 10:58:20] [INFO ] Invariant cache hit.
[2023-03-20 10:58:20] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2023-03-20 10:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:58:20] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-20 10:58:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-20 10:58:21] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:58:21] [INFO ] Invariant cache hit.
[2023-03-20 10:58:21] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-20 10:58:21] [INFO ] Invariant cache hit.
[2023-03-20 10:58:21] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-20 10:58:21] [INFO ] Invariant cache hit.
[2023-03-20 10:58:21] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 323/323 places, 322/322 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/323 stabilizing places and 1/322 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 p2 p3))]
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 75 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
[2023-03-20 10:58:22] [INFO ] Invariant cache hit.
[2023-03-20 10:58:22] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-20 10:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:58:22] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-20 10:58:22] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-20 10:58:22] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 401 ms.
Product exploration explored 100000 steps with 0 reset in 481 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 322
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 35 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-20 10:58:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:58:24] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-20 10:58:24] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/323 places, 322/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2023-03-20 10:58:24] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:58:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-20 10:58:24] [INFO ] Invariant cache hit.
[2023-03-20 10:58:24] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-20 10:58:24] [INFO ] Invariant cache hit.
[2023-03-20 10:58:25] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 323/323 places, 322/322 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-15 finished in 8436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p1&&G(p2)))))))'
Found a Shortening insensitive property : ShieldRVt-PT-040A-LTLFireability-04
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 12 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2023-03-20 10:58:25] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 10:58:25] [INFO ] Implicit Places using invariants in 163 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 185 ms. Remains : 321/323 places, 321/322 transitions.
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s75 0), p1:(EQ s163 0), p2:(OR (EQ s16 0) (EQ s18 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 560 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 504 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Finished probabilistic random walk after 4618 steps, run visited all 7 properties in 115 ms. (steps per millisecond=40 )
Probabilistic random walk after 4618 steps, saw 4466 distinct states, run finished after 115 ms. (steps per millisecond=40 ) properties seen :7
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 710 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2023-03-20 10:58:29] [INFO ] Computed 160 place invariants in 8 ms
[2023-03-20 10:58:29] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-20 10:58:29] [INFO ] Invariant cache hit.
[2023-03-20 10:58:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-20 10:58:29] [INFO ] Invariant cache hit.
[2023-03-20 10:58:30] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 498 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Finished probabilistic random walk after 4618 steps, run visited all 7 properties in 140 ms. (steps per millisecond=32 )
Probabilistic random walk after 4618 steps, saw 4466 distinct states, run finished after 140 ms. (steps per millisecond=32 ) properties seen :7
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 570 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 482 ms.
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2023-03-20 10:58:33] [INFO ] Invariant cache hit.
[2023-03-20 10:58:33] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-20 10:58:33] [INFO ] Invariant cache hit.
[2023-03-20 10:58:34] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-20 10:58:34] [INFO ] Invariant cache hit.
[2023-03-20 10:58:34] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 321/321 places, 321/321 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 9212 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)))'
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)||G((p1&&X((p2&&G(p3)&&(p1 U (p4||G(p1)))))))))'
Found a Lengthening insensitive property : ShieldRVt-PT-040A-LTLFireability-15
Stuttering acceptance computed with spot in 261 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 22 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2023-03-20 10:58:34] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-20 10:58:35] [INFO ] Implicit Places using invariants in 289 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 292 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 320 ms. Remains : 321/323 places, 321/322 transitions.
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s168 1) (EQ s170 1) (EQ s175 1)), p1:(NEQ s17 1), p2:(EQ s0 0), p3:(EQ s17 0)], 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/321 stabilizing places and 1/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (AND p1 p2 p3)), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 906 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND p0 p1 p2 p3))), (X (AND p1 p2 p3)), (X (AND (NOT p0) p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (AND (NOT p0) p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 p2 p3))]
Knowledge based reduction with 17 factoid took 808 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
// Phase 1: matrix 321 rows 321 cols
[2023-03-20 10:58:38] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 10:58:38] [INFO ] [Real]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-20 10:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:58:38] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-20 10:58:38] [INFO ] Computed and/alt/rep : 320/1393/320 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-20 10:58:38] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 321 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2023-03-20 10:58:38] [INFO ] Invariant cache hit.
[2023-03-20 10:58:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-20 10:58:38] [INFO ] Invariant cache hit.
[2023-03-20 10:58:38] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-20 10:58:38] [INFO ] Invariant cache hit.
[2023-03-20 10:58:39] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/321 stabilizing places and 1/321 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (AND p1 p2 p3)), (X (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (OR (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 p2 p3))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
[2023-03-20 10:58:40] [INFO ] Invariant cache hit.
[2023-03-20 10:58:40] [INFO ] [Real]Absence check using 160 positive place invariants in 23 ms returned sat
[2023-03-20 10:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:58:40] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-20 10:58:40] [INFO ] Computed and/alt/rep : 320/1393/320 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-20 10:58:40] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 108 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Product exploration explored 100000 steps with 0 reset in 484 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3))]
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2023-03-20 10:58:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 10:58:41] [INFO ] Invariant cache hit.
[2023-03-20 10:58:42] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 321/321 places, 321/321 transitions.
Support contains 2 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 2 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2023-03-20 10:58:42] [INFO ] Invariant cache hit.
[2023-03-20 10:58:42] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-20 10:58:42] [INFO ] Invariant cache hit.
[2023-03-20 10:58:42] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-20 10:58:42] [INFO ] Invariant cache hit.
[2023-03-20 10:58:42] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 321/321 places, 321/321 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-15 finished in 8380 ms.
[2023-03-20 10:58:42] [INFO ] Flatten gal took : 24 ms
[2023-03-20 10:58:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 10:58:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 322 transitions and 1364 arcs took 3 ms.
Total runtime 82947 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2277/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2277/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2277/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-040A-LTLFireability-04
Could not compute solution for formula : ShieldRVt-PT-040A-LTLFireability-12
Could not compute solution for formula : ShieldRVt-PT-040A-LTLFireability-15

BK_STOP 1679309923824

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-040A-LTLFireability-04
ltl formula formula --ltl=/tmp/2277/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 323 places, 322 transitions and 1364 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2277/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2277/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2277/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2277/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVt-PT-040A-LTLFireability-12
ltl formula formula --ltl=/tmp/2277/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 323 places, 322 transitions and 1364 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2277/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2277/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2277/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2277/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVt-PT-040A-LTLFireability-15
ltl formula formula --ltl=/tmp/2277/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 323 places, 322 transitions and 1364 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2277/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2277/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2277/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2277/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-040A, 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 r425-tajo-167905978000308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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