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.r423-tajo-167905976300148.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 lolaxred
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679242990741

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:23:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:23:13] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-19 16:23:13] [INFO ] Transformed 703 places.
[2023-03-19 16:23:13] [INFO ] Transformed 953 transitions.
[2023-03-19 16:23:13] [INFO ] Found NUPN structural information;
[2023-03-19 16:23:13] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 59 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:23:13] [INFO ] Computed 201 place invariants in 32 ms
[2023-03-19 16:23:16] [INFO ] Implicit Places using invariants in 3060 ms returned []
[2023-03-19 16:23:16] [INFO ] Invariant cache hit.
[2023-03-19 16:23:21] [INFO ] Implicit Places using invariants and state equation in 4828 ms returned []
Implicit Place search using SMT with State Equation took 7914 ms to find 0 implicit places.
[2023-03-19 16:23:21] [INFO ] Invariant cache hit.
[2023-03-19 16:23:22] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8540 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 84 out of 703 places after structural reductions.
[2023-03-19 16:23:22] [INFO ] Flatten gal took : 228 ms
[2023-03-19 16:23:22] [INFO ] Flatten gal took : 103 ms
[2023-03-19 16:23:23] [INFO ] Input system was already deterministic with 953 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:23:23] [INFO ] Invariant cache hit.
[2023-03-19 16:23:24] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:23:24] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:23:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 64 ms returned sat
[2023-03-19 16:23:26] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 5 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2760 ms
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 1 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-19 16:23:37] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:23:37] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
[2023-03-19 16:23:45] [INFO ] Deduced a trap composed of 11 places in 8635 ms of which 28 ms to minimize.
[2023-03-19 16:23:46] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-19 16:23:46] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2023-03-19 16:23:46] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2023-03-19 16:23:47] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-19 16:23:47] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 10 ms to minimize.
[2023-03-19 16:23:47] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 9 ms to minimize.
[2023-03-19 16:23:47] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:23:47] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:23:48] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:23:48] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2023-03-19 16:23:48] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:23:48] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:23:48] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:23:49] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 15 ms to minimize.
[2023-03-19 16:23:49] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:23:49] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2023-03-19 16:23:49] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 17 ms to minimize.
[2023-03-19 16:23:49] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 20974 ms
[2023-03-19 16:23:49] [INFO ] After 24473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 16:23:49] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 187 ms.
Support contains 12 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 101 place count 702 transition count 952
Applied a total of 101 rules in 162 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :2
Finished Best-First random walk after 8873 steps, including 2 resets, run visited all 1 properties in 36 ms. (steps per millisecond=246 )
FORMULA ShieldRVs-PT-050A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||(!p1 U X(p0)))))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 34 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:23:51] [INFO ] Invariant cache hit.
[2023-03-19 16:23:52] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2023-03-19 16:23:52] [INFO ] Invariant cache hit.
[2023-03-19 16:23:53] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 2705 ms to find 0 implicit places.
[2023-03-19 16:23:53] [INFO ] Invariant cache hit.
[2023-03-19 16:23:54] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3197 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-00 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s115 1) (EQ s132 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 690 steps with 0 reset in 17 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-00 finished in 3644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(p1 U p2)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:23:54] [INFO ] Invariant cache hit.
[2023-03-19 16:23:55] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-19 16:23:55] [INFO ] Invariant cache hit.
[2023-03-19 16:23:55] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-19 16:23:55] [INFO ] Invariant cache hit.
[2023-03-19 16:23:56] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 479 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (EQ s236 1) (EQ s240 1) (EQ s247 1)), p2:(AND (EQ s59 1) (EQ s74 1) (EQ s85 1)), p1:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-01 finished in 2410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:23:57] [INFO ] Invariant cache hit.
[2023-03-19 16:23:57] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-19 16:23:57] [INFO ] Invariant cache hit.
[2023-03-19 16:23:58] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-03-19 16:23:58] [INFO ] Invariant cache hit.
[2023-03-19 16:23:59] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2326 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s33 1), p1:(OR (EQ s33 1) (AND (EQ s10 1) (EQ s16 1) (EQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-02 finished in 2524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:23:59] [INFO ] Invariant cache hit.
[2023-03-19 16:24:00] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-19 16:24:00] [INFO ] Invariant cache hit.
[2023-03-19 16:24:01] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2023-03-19 16:24:01] [INFO ] Invariant cache hit.
[2023-03-19 16:24:01] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2389 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s537 1) (AND (EQ s164 1) (EQ s168 1) (EQ s177 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p1))&&G(!p2))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 17 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:24:02] [INFO ] Invariant cache hit.
[2023-03-19 16:24:02] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-19 16:24:02] [INFO ] Invariant cache hit.
[2023-03-19 16:24:03] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2023-03-19 16:24:03] [INFO ] Invariant cache hit.
[2023-03-19 16:24:04] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1822 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, true, (AND p0 (NOT p1)), (AND p2 p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 2}, { cond=(NOT p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s118 1) (EQ s119 1) (EQ s124 1)), p0:(OR (NOT (AND (EQ s313 1) (EQ s315 1) (EQ s320 1))) (AND (EQ s118 1) (EQ s119 1) (EQ s124 1))), p1:(EQ s3...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55369 steps with 97 reset in 363 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 2508 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 U p1)&&X((F(p2) U G(p3)))))))'
Support contains 10 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 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 702 transition count 952
Applied a total of 2 rules in 62 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-19 16:24:04] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 16:24:05] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-19 16:24:05] [INFO ] Invariant cache hit.
[2023-03-19 16:24:06] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2023-03-19 16:24:06] [INFO ] Redundant transitions in 289 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:24:06] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:24:07] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2529 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s75 1), p0:(AND (EQ s3 1) (EQ s20 1) (EQ s29 1)), p3:(AND (EQ s304 1) (EQ s310 1) (EQ s317 1)), p2:(AND (EQ s129 1) (EQ s144 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 662 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 3053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:24:07] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-19 16:24:08] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-19 16:24:08] [INFO ] Invariant cache hit.
[2023-03-19 16:24:08] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-19 16:24:08] [INFO ] Invariant cache hit.
[2023-03-19 16:24:09] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1653 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1)), p0:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1) (EQ s428 1) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-11 finished in 1782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1) U !p2)))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:24:09] [INFO ] Invariant cache hit.
[2023-03-19 16:24:09] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-19 16:24:09] [INFO ] Invariant cache hit.
[2023-03-19 16:24:10] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-03-19 16:24:10] [INFO ] Invariant cache hit.
[2023-03-19 16:24:11] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1906 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 151 ms :[p2, p2, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s178 1) (EQ s182 1) (EQ s191 1)), p1:(EQ s11 1), p0:(OR (EQ s374 1) (EQ s60 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2613 ms.
Product exploration explored 100000 steps with 50000 reset in 2910 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 7806 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' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 56 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-19 16:24:17] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 16:24:17] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-19 16:24:17] [INFO ] Invariant cache hit.
[2023-03-19 16:24:18] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2023-03-19 16:24:19] [INFO ] Redundant transitions in 362 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:24:19] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:24:19] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 47 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2465 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(OR p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s414 1) (EQ s419 1)), p0:(AND (EQ s414 1) (EQ s419 1)), p1:(NEQ s439 1), p3:(AND (EQ s500 1) (EQ s506 1) (EQ s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 156 reset in 654 ms.
Product exploration explored 100000 steps with 151 reset in 660 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 898 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:24:23] [INFO ] Invariant cache hit.
[2023-03-19 16:24:23] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:24:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-19 16:24:24] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:24:24] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 13 ms to minimize.
[2023-03-19 16:24:24] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-19 16:24:25] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:24:25] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2023-03-19 16:24:25] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2023-03-19 16:24:25] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 0 ms to minimize.
[2023-03-19 16:24:26] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-19 16:24:26] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2023-03-19 16:24:26] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:24:26] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:24:27] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-19 16:24:27] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 0 ms to minimize.
[2023-03-19 16:24:27] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-19 16:24:27] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 0 ms to minimize.
[2023-03-19 16:24:27] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:24:28] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2023-03-19 16:24:28] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-19 16:24:28] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:24:28] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:24:28] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2023-03-19 16:24:29] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:24:29] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:24:29] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-19 16:24:29] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:24:30] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-19 16:24:30] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-19 16:24:30] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:24:30] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-19 16:24:31] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2023-03-19 16:24:31] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2023-03-19 16:24:31] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-03-19 16:24:32] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2023-03-19 16:24:32] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-19 16:24:32] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:24:32] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-19 16:24:33] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2023-03-19 16:24:33] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:24:33] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-19 16:24:33] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:24:33] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-19 16:24:34] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2023-03-19 16:24:34] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-19 16:24:34] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-19 16:24:34] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:24:35] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2023-03-19 16:24:35] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:24:35] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:24:35] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 0 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:24:36] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:24:37] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:24:37] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:24:37] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:24:37] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2023-03-19 16:24:37] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:24:38] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 0 ms to minimize.
[2023-03-19 16:24:38] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:24:38] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:24:38] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:24:38] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:24:39] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:24:39] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:24:39] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:24:39] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:24:39] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:24:40] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2023-03-19 16:24:40] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:24:40] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:24:40] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 0 ms to minimize.
[2023-03-19 16:24:40] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 0 ms to minimize.
[2023-03-19 16:24:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:24:41] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2023-03-19 16:24:41] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:24:41] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-19 16:24:42] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:24:42] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:24:42] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-19 16:24:42] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:24:42] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:24:43] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:24:43] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2023-03-19 16:24:43] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:24:43] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2023-03-19 16:24:44] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2023-03-19 16:24:44] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:24:44] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2023-03-19 16:24:44] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:24:44] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 1 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:24:45] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 1 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-19 16:24:46] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 0 ms to minimize.
[2023-03-19 16:24:47] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:24:48] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:24:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:24:48] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 91 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Finished Best-First random walk after 1887 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 17 factoid took 1428 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 171 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 33 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-19 16:24:50] [INFO ] Invariant cache hit.
[2023-03-19 16:24:50] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-19 16:24:50] [INFO ] Invariant cache hit.
[2023-03-19 16:24:51] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2023-03-19 16:24:52] [INFO ] Redundant transitions in 229 ms returned []
[2023-03-19 16:24:52] [INFO ] Invariant cache hit.
[2023-03-19 16:24:52] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2587 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 823 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 16:24:54] [INFO ] Invariant cache hit.
[2023-03-19 16:24:54] [INFO ] [Real]Absence check using 201 positive place invariants in 45 ms returned sat
[2023-03-19 16:24:55] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:24:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 48 ms returned sat
[2023-03-19 16:24:56] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:24:56] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:24:56] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 4 ms to minimize.
[2023-03-19 16:24:56] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:24:56] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:24:57] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2023-03-19 16:24:57] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:24:57] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:24:57] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:24:57] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:24:58] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:24:58] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-19 16:24:58] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:24:58] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:24:58] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:24:59] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-19 16:24:59] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:24:59] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:24:59] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:24:59] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:25:00] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-19 16:25:00] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:25:00] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:25:00] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-19 16:25:00] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2023-03-19 16:25:01] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:25:01] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:25:01] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-19 16:25:01] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2023-03-19 16:25:01] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:25:02] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:25:02] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:25:02] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:25:02] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:25:02] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:25:03] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-19 16:25:04] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 0 ms to minimize.
[2023-03-19 16:25:05] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 0 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 0 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2023-03-19 16:25:06] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:25:07] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:25:08] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:25:09] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:25:10] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:25:11] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2023-03-19 16:25:12] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:25:13] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:25:14] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:25:15] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:25:16] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:25:17] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:25:18] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2023-03-19 16:25:18] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-03-19 16:25:18] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 0 ms to minimize.
[2023-03-19 16:25:18] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:25:19] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 0 ms to minimize.
[2023-03-19 16:25:19] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2023-03-19 16:25:19] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-19 16:25:19] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:25:19] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:25:20] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:25:20] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:25:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:25:20] [INFO ] After 25158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 75 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Finished Best-First random walk after 5047 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 17 factoid took 1169 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 193 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 157 reset in 555 ms.
Product exploration explored 100000 steps with 155 reset in 621 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-19 16:25:23] [INFO ] Invariant cache hit.
[2023-03-19 16:25:24] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-19 16:25:24] [INFO ] Invariant cache hit.
[2023-03-19 16:25:24] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-03-19 16:25:25] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-19 16:25:25] [INFO ] Invariant cache hit.
[2023-03-19 16:25:25] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2037 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 68447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(G(p1)))&&F(p2))))'
Support contains 12 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:25:25] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 16:25:26] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-19 16:25:26] [INFO ] Invariant cache hit.
[2023-03-19 16:25:26] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-19 16:25:26] [INFO ] Invariant cache hit.
[2023-03-19 16:25:27] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1553 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s423 1) (EQ s438 1) (EQ s449 1) (EQ s383 1) (EQ s385 1) (EQ s390 1)), p2:(AND (EQ s202 1) (EQ s203 1) (EQ s207 1)), p1:(AND (EQ s454 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 700 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))&&X((!p2 U (G(!p2)||(!p2&&(X(p3)||F(!p4)))))))))'
Support contains 11 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:25:27] [INFO ] Invariant cache hit.
[2023-03-19 16:25:28] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-19 16:25:28] [INFO ] Invariant cache hit.
[2023-03-19 16:25:28] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2023-03-19 16:25:28] [INFO ] Invariant cache hit.
[2023-03-19 16:25:29] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1796 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), true, (AND (NOT p1) p0), p2, (AND p4 p2 (NOT p3)), p4]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p4 p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p4, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s652 1) (EQ s657 1))) (NOT (AND (EQ s106 1) (EQ s111 1)))), p0:(AND (EQ s106 1) (EQ s111 1)), p2:(EQ s109 1), p4:(AND (EQ s684 1) (E...], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1603 ms.
Product exploration explored 100000 steps with 33333 reset in 1558 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) (NOT p4) (NOT p3)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p4 (NOT p2)))))
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 7 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-15 finished in 5715 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' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
[2023-03-19 16:25:33] [INFO ] Flatten gal took : 121 ms
[2023-03-19 16:25:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:25:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4600 arcs took 11 ms.
Total runtime 140575 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1679243254414

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-050A-LTLFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 ShieldRVs-PT-050A-LTLFireability-13 173771 m, 34754 m/sec, 1162552 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 4/32 ShieldRVs-PT-050A-LTLFireability-13 341094 m, 33464 m/sec, 2406422 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 5/32 ShieldRVs-PT-050A-LTLFireability-13 516772 m, 35135 m/sec, 3639532 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 6/32 ShieldRVs-PT-050A-LTLFireability-13 688878 m, 34421 m/sec, 4998977 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 8/32 ShieldRVs-PT-050A-LTLFireability-13 863759 m, 34976 m/sec, 6423448 t fired, .

Time elapsed: 25 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 9/32 ShieldRVs-PT-050A-LTLFireability-13 1042009 m, 35650 m/sec, 7862683 t fired, .

Time elapsed: 30 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 11/32 ShieldRVs-PT-050A-LTLFireability-13 1185065 m, 28611 m/sec, 9070312 t fired, .

Time elapsed: 35 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 12/32 ShieldRVs-PT-050A-LTLFireability-13 1317823 m, 26551 m/sec, 10226652 t fired, .

Time elapsed: 40 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 13/32 ShieldRVs-PT-050A-LTLFireability-13 1495058 m, 35447 m/sec, 11623292 t fired, .

Time elapsed: 45 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 15/32 ShieldRVs-PT-050A-LTLFireability-13 1661615 m, 33311 m/sec, 13091913 t fired, .

Time elapsed: 50 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 16/32 ShieldRVs-PT-050A-LTLFireability-13 1824642 m, 32605 m/sec, 14562917 t fired, .

Time elapsed: 55 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 17/32 ShieldRVs-PT-050A-LTLFireability-13 1971343 m, 29340 m/sec, 15864311 t fired, .

Time elapsed: 60 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 18/32 ShieldRVs-PT-050A-LTLFireability-13 2105796 m, 26890 m/sec, 17164468 t fired, .

Time elapsed: 65 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 20/32 ShieldRVs-PT-050A-LTLFireability-13 2260877 m, 31016 m/sec, 18600345 t fired, .

Time elapsed: 70 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 21/32 ShieldRVs-PT-050A-LTLFireability-13 2471401 m, 42104 m/sec, 19968900 t fired, .

Time elapsed: 75 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 23/32 ShieldRVs-PT-050A-LTLFireability-13 2666919 m, 39103 m/sec, 21375128 t fired, .

Time elapsed: 80 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 24/32 ShieldRVs-PT-050A-LTLFireability-13 2854804 m, 37577 m/sec, 22825095 t fired, .

Time elapsed: 85 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3600 26/32 ShieldRVs-PT-050A-LTLFireability-13 3029498 m, 34938 m/sec, 24124895 t fired, .

Time elapsed: 90 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3600 27/32 ShieldRVs-PT-050A-LTLFireability-13 3215545 m, 37209 m/sec, 25513848 t fired, .

Time elapsed: 95 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3600 29/32 ShieldRVs-PT-050A-LTLFireability-13 3390806 m, 35052 m/sec, 26925556 t fired, .

Time elapsed: 100 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3600 30/32 ShieldRVs-PT-050A-LTLFireability-13 3525640 m, 26966 m/sec, 28135879 t fired, .

Time elapsed: 105 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3600 31/32 ShieldRVs-PT-050A-LTLFireability-13 3657173 m, 26306 m/sec, 29475988 t fired, .

Time elapsed: 110 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3600 32/32 ShieldRVs-PT-050A-LTLFireability-13 3815491 m, 31663 m/sec, 30761014 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-050A-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050A-LTLFireability-13: LTL unknown AGGR


Time elapsed: 120 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976300148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;