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-167905976300124.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-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K 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-030B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679242589921

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-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:16:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:16:31] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-19 16:16:31] [INFO ] Transformed 1203 places.
[2023-03-19 16:16:31] [INFO ] Transformed 1353 transitions.
[2023-03-19 16:16:31] [INFO ] Found NUPN structural information;
[2023-03-19 16:16:31] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-030B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 1000 transition count 1150
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 1000 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 407 place count 999 transition count 1149
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 999 transition count 1149
Applied a total of 408 rules in 177 ms. Remains 999 /1203 variables (removed 204) and now considering 1149/1353 (removed 204) transitions.
// Phase 1: matrix 1149 rows 999 cols
[2023-03-19 16:16:32] [INFO ] Computed 121 place invariants in 26 ms
[2023-03-19 16:16:32] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-19 16:16:32] [INFO ] Invariant cache hit.
[2023-03-19 16:16:33] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-19 16:16:33] [INFO ] Invariant cache hit.
[2023-03-19 16:16:34] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1203 places, 1149/1353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2521 ms. Remains : 999/1203 places, 1149/1353 transitions.
Support contains 53 out of 999 places after structural reductions.
[2023-03-19 16:16:35] [INFO ] Flatten gal took : 258 ms
[2023-03-19 16:16:35] [INFO ] Flatten gal took : 151 ms
[2023-03-19 16:16:35] [INFO ] Input system was already deterministic with 1149 transitions.
Support contains 48 out of 999 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 16:16:36] [INFO ] Invariant cache hit.
[2023-03-19 16:16:36] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2023-03-19 16:16:36] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 16:16:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-19 16:16:38] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 16:16:38] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 5 ms to minimize.
[2023-03-19 16:16:38] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 2 ms to minimize.
[2023-03-19 16:16:39] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 2 ms to minimize.
[2023-03-19 16:16:39] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 0 ms to minimize.
[2023-03-19 16:16:39] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:16:39] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:16:39] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:16:40] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:16:40] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:16:40] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 1 ms to minimize.
[2023-03-19 16:16:40] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:16:40] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:16:41] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:16:42] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:16:42] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 1 ms to minimize.
[2023-03-19 16:16:42] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:16:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4252 ms
[2023-03-19 16:16:42] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:16:42] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 968 ms
[2023-03-19 16:16:43] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-19 16:16:44] [INFO ] After 6604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-19 16:16:44] [INFO ] After 7503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 537 ms.
Support contains 19 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 999 transition count 1033
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 883 transition count 1033
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 232 place count 883 transition count 883
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 532 place count 733 transition count 883
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 536 place count 729 transition count 879
Iterating global reduction 2 with 4 rules applied. Total rules applied 540 place count 729 transition count 879
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 2 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1136 place count 431 transition count 581
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 2 with 59 rules applied. Total rules applied 1195 place count 431 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1196 place count 430 transition count 580
Applied a total of 1196 rules in 247 ms. Remains 430 /999 variables (removed 569) and now considering 580/1149 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 430/999 places, 580/1149 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Finished Best-First random walk after 6469 steps, including 2 resets, run visited all 1 properties in 24 ms. (steps per millisecond=269 )
FORMULA ShieldRVs-PT-030B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 242 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(G((p0&&F((X(p2)||p1))))))'
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 60 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-19 16:16:46] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 16:16:46] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-19 16:16:46] [INFO ] Invariant cache hit.
[2023-03-19 16:16:47] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2023-03-19 16:16:47] [INFO ] Invariant cache hit.
[2023-03-19 16:16:48] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2234 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s508 1), p1:(OR (EQ s748 0) (EQ s751 0) (EQ s758 0)), p2:(EQ s126 0)], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-00 finished in 2729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&F(p2)&&p0))))'
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 85 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:16:48] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-19 16:16:49] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-19 16:16:49] [INFO ] Invariant cache hit.
[2023-03-19 16:16:50] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2023-03-19 16:16:50] [INFO ] Invariant cache hit.
[2023-03-19 16:16:50] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2028 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s468 1) (EQ s477 1) (EQ s498 1)), p1:(AND (EQ s468 1) (EQ s477 1) (EQ s498 1)), p2:(AND (EQ s459 1) (EQ s462 1) (EQ s469 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1345 steps with 0 reset in 18 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-01 finished in 2247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 52 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-19 16:16:50] [INFO ] Computed 121 place invariants in 14 ms
[2023-03-19 16:16:51] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-19 16:16:51] [INFO ] Invariant cache hit.
[2023-03-19 16:16:52] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2023-03-19 16:16:52] [INFO ] Invariant cache hit.
[2023-03-19 16:16:52] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1840 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s237 1), p0:(AND (EQ s75 1) (EQ s78 1) (EQ s85 1)), p1:(NEQ s387 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 77 reset in 589 ms.
Product exploration explored 100000 steps with 77 reset in 519 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/993 stabilizing places and 240/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 682 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:16:55] [INFO ] Invariant cache hit.
[2023-03-19 16:16:55] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-19 16:16:55] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:16:55] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-19 16:16:56] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:16:56] [INFO ] Deduced a trap composed of 42 places in 303 ms of which 1 ms to minimize.
[2023-03-19 16:16:57] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 0 ms to minimize.
[2023-03-19 16:16:57] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 1 ms to minimize.
[2023-03-19 16:16:57] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 1 ms to minimize.
[2023-03-19 16:16:58] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 14 ms to minimize.
[2023-03-19 16:16:58] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 1 ms to minimize.
[2023-03-19 16:16:58] [INFO ] Deduced a trap composed of 60 places in 268 ms of which 1 ms to minimize.
[2023-03-19 16:16:58] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2023-03-19 16:16:59] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2023-03-19 16:16:59] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 0 ms to minimize.
[2023-03-19 16:16:59] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 1 ms to minimize.
[2023-03-19 16:17:00] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 0 ms to minimize.
[2023-03-19 16:17:00] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-19 16:17:00] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 1 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 1 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 1 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 0 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2023-03-19 16:17:01] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:17:02] [INFO ] Deduced a trap composed of 61 places in 208 ms of which 1 ms to minimize.
[2023-03-19 16:17:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5728 ms
[2023-03-19 16:17:02] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:17:02] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 1 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 0 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 0 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 1 ms to minimize.
[2023-03-19 16:17:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1317 ms
[2023-03-19 16:17:03] [INFO ] After 7633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-19 16:17:03] [INFO ] After 7944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 993 transition count 1024
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 874 transition count 1024
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 238 place count 874 transition count 874
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 538 place count 724 transition count 874
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 723 transition count 873
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 723 transition count 873
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1136 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1198 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1199 place count 424 transition count 574
Applied a total of 1199 rules in 178 ms. Remains 424 /993 variables (removed 569) and now considering 574/1143 (removed 569) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 424/993 places, 574/1143 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-19 16:17:04] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-19 16:17:04] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-19 16:17:04] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-19 16:17:04] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 12 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-19 16:17:04] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:17:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:17:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 389 ms
[2023-03-19 16:17:05] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-19 16:17:05] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 424/424 places, 574/574 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 442589 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 442589 steps, saw 272486 distinct states, run finished after 3002 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:17:08] [INFO ] Invariant cache hit.
[2023-03-19 16:17:08] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:17:08] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-19 16:17:08] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:17:08] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-19 16:17:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 330 ms
[2023-03-19 16:17:09] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:17:09] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 38 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 24 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-19 16:17:09] [INFO ] Invariant cache hit.
[2023-03-19 16:17:09] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 16:17:09] [INFO ] Invariant cache hit.
[2023-03-19 16:17:09] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-19 16:17:10] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-19 16:17:10] [INFO ] Invariant cache hit.
[2023-03-19 16:17:10] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1099 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:17:10] [INFO ] Invariant cache hit.
[2023-03-19 16:17:10] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-19 16:17:10] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-19 16:17:10] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2023-03-19 16:17:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 330 ms
[2023-03-19 16:17:11] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 16:17:11] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 385 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 1143 rows 993 cols
[2023-03-19 16:17:11] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 16:17:12] [INFO ] [Real]Absence check using 121 positive place invariants in 63 ms returned sat
[2023-03-19 16:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:17:14] [INFO ] [Real]Absence check using state equation in 2086 ms returned sat
[2023-03-19 16:17:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:17:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 78 ms returned sat
[2023-03-19 16:17:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:17:16] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2023-03-19 16:17:16] [INFO ] Computed and/alt/rep : 1142/3615/1142 causal constraints (skipped 0 transitions) in 55 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:17:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 5 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1023
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 873 transition count 1023
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 873 transition count 874
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1128 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 426 transition count 576
Applied a total of 1130 rules in 127 ms. Remains 426 /993 variables (removed 567) and now considering 576/1143 (removed 567) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-19 16:17:29] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-19 16:17:29] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-19 16:17:30] [INFO ] Invariant cache hit.
[2023-03-19 16:17:30] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-19 16:17:31] [INFO ] Redundant transitions in 608 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2023-03-19 16:17:31] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:17:31] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/993 places, 575/1143 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1764 ms. Remains : 426/993 places, 575/1143 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 478 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:17:32] [INFO ] Invariant cache hit.
[2023-03-19 16:17:32] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-19 16:17:32] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-19 16:17:32] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-19 16:17:32] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 16:17:32] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 575/575 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 574
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 573
Applied a total of 65 rules in 55 ms. Remains 424 /426 variables (removed 2) and now considering 573/575 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 424/426 places, 573/575 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 489590 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 489590 steps, saw 276452 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 573 rows 424 cols
[2023-03-19 16:17:35] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 16:17:36] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:17:36] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-19 16:17:36] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:36] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:17:36] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:17:36] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:17:36] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:17:36] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:17:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2023-03-19 16:17:36] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 16:17:36] [INFO ] After 745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 424/424 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:17:37] [INFO ] Invariant cache hit.
[2023-03-19 16:17:37] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-19 16:17:37] [INFO ] Invariant cache hit.
[2023-03-19 16:17:37] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-19 16:17:37] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 16:17:37] [INFO ] Invariant cache hit.
[2023-03-19 16:17:37] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:17:38] [INFO ] Invariant cache hit.
[2023-03-19 16:17:38] [INFO ] [Real]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-19 16:17:38] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:17:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-19 16:17:38] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:17:38] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 16:17:38] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 413 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 575 rows 426 cols
[2023-03-19 16:17:39] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-19 16:17:39] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-19 16:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:17:39] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-19 16:17:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:17:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-19 16:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:17:39] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-19 16:17:39] [INFO ] Computed and/alt/rep : 503/2158/503 causal constraints (skipped 68 transitions) in 30 ms.
[2023-03-19 16:17:44] [INFO ] Added : 478 causal constraints over 96 iterations in 4604 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 243 reset in 579 ms.
Product exploration explored 100000 steps with 243 reset in 602 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 575/575 transitions.
Applied a total of 0 rules in 14 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-19 16:17:45] [INFO ] Invariant cache hit.
[2023-03-19 16:17:46] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-19 16:17:46] [INFO ] Invariant cache hit.
[2023-03-19 16:17:46] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-19 16:17:46] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-19 16:17:46] [INFO ] Invariant cache hit.
[2023-03-19 16:17:46] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1048 ms. Remains : 426/426 places, 575/575 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 56278 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(X((p0||X(X(X(F(p1))))||G(p2))))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 993 transition count 1143
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 993 transition count 1143
Applied a total of 12 rules in 62 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-19 16:17:47] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:17:47] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-19 16:17:47] [INFO ] Invariant cache hit.
[2023-03-19 16:17:48] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-19 16:17:48] [INFO ] Invariant cache hit.
[2023-03-19 16:17:48] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/999 places, 1143/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1454 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=true, acceptance={} source=9 dest: 8}]], initial=9, aps=[p1:(EQ s255 0), p2:(EQ s417 1), p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14285 reset in 377 ms.
Product exploration explored 100000 steps with 14285 reset in 442 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 2277 steps, including 1 resets, run visited all 6 properties in 28 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND p2 (NOT p0))), (F p2)]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Applied a total of 0 rules in 23 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2023-03-19 16:17:51] [INFO ] Invariant cache hit.
[2023-03-19 16:17:51] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-19 16:17:51] [INFO ] Invariant cache hit.
[2023-03-19 16:17:52] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-19 16:17:52] [INFO ] Invariant cache hit.
[2023-03-19 16:17:53] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 993/993 places, 1143/1143 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 3665 steps, including 2 resets, run visited all 6 properties in 34 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND p2 (NOT p0))), (F p2)]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 10 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 317 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 14285 reset in 317 ms.
Product exploration explored 100000 steps with 14285 reset in 333 ms.
Applying partial POR strategy [true, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 993 transition count 1143
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 119 place count 993 transition count 1172
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 179 place count 993 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 992 transition count 1171
Deduced a syphon composed of 178 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 992 transition count 1171
Performed 389 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 1 with 389 rules applied. Total rules applied 570 place count 992 transition count 1171
Renaming transitions due to excessive name length > 1024 char.
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 778 place count 784 transition count 963
Deduced a syphon composed of 359 places in 1 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 986 place count 784 transition count 963
Deduced a syphon composed of 359 places in 1 ms
Applied a total of 986 rules in 214 ms. Remains 784 /993 variables (removed 209) and now considering 963/1143 (removed 180) transitions.
[2023-03-19 16:17:56] [INFO ] Redundant transitions in 179 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 784 cols
[2023-03-19 16:17:56] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 16:17:56] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 784/993 places, 962/1143 transitions.
Deduced a syphon composed of 359 places in 1 ms
Applied a total of 0 rules in 19 ms. Remains 784 /784 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 906 ms. Remains : 784/993 places, 962/1143 transitions.
Support contains 3 out of 993 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 993/993 places, 1143/1143 transitions.
Applied a total of 0 rules in 16 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-19 16:17:56] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:17:56] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-19 16:17:56] [INFO ] Invariant cache hit.
[2023-03-19 16:17:57] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-19 16:17:57] [INFO ] Invariant cache hit.
[2023-03-19 16:17:58] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 993/993 places, 1143/1143 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-05 finished in 11006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 38 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:17:58] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 16:17:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-19 16:17:58] [INFO ] Invariant cache hit.
[2023-03-19 16:17:59] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2023-03-19 16:17:59] [INFO ] Invariant cache hit.
[2023-03-19 16:17:59] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1606 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s939 1) (EQ s942 1) (EQ s950 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-06 finished in 1685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 44 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
[2023-03-19 16:17:59] [INFO ] Invariant cache hit.
[2023-03-19 16:18:00] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-19 16:18:00] [INFO ] Invariant cache hit.
[2023-03-19 16:18:00] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2023-03-19 16:18:00] [INFO ] Invariant cache hit.
[2023-03-19 16:18:01] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1443 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 216 reset in 360 ms.
Product exploration explored 100000 steps with 217 reset in 411 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 499 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-19 16:18:02] [INFO ] Invariant cache hit.
[2023-03-19 16:18:02] [INFO ] [Real]Absence check using 121 positive place invariants in 63 ms returned sat
[2023-03-19 16:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:18:04] [INFO ] [Real]Absence check using state equation in 1677 ms returned sat
[2023-03-19 16:18:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:18:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 81 ms returned sat
[2023-03-19 16:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:18:06] [INFO ] [Nat]Absence check using state equation in 1630 ms returned sat
[2023-03-19 16:18:07] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 111 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:18:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 991 transition count 1021
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 871 transition count 1021
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 871 transition count 870
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 720 transition count 870
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1132 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1134 place count 423 transition count 573
Applied a total of 1134 rules in 129 ms. Remains 423 /992 variables (removed 569) and now considering 573/1142 (removed 569) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-19 16:18:19] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-19 16:18:20] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-19 16:18:20] [INFO ] Invariant cache hit.
[2023-03-19 16:18:20] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-19 16:18:20] [INFO ] Redundant transitions in 129 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-19 16:18:20] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:18:21] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/992 places, 572/1142 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1348 ms. Remains : 423/992 places, 572/1142 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
[2023-03-19 16:18:21] [INFO ] Invariant cache hit.
[2023-03-19 16:18:21] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-19 16:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:18:22] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-19 16:18:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:18:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-19 16:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:18:22] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-19 16:18:22] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 42 ms.
[2023-03-19 16:18:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-19 16:18:27] [INFO ] Added : 483 causal constraints over 98 iterations in 5228 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27049 reset in 544 ms.
Product exploration explored 100000 steps with 27052 reset in 554 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 7 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-19 16:18:29] [INFO ] Invariant cache hit.
[2023-03-19 16:18:29] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-19 16:18:29] [INFO ] Invariant cache hit.
[2023-03-19 16:18:29] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-19 16:18:29] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-19 16:18:29] [INFO ] Invariant cache hit.
[2023-03-19 16:18:30] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 991 ms. Remains : 423/423 places, 572/572 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 30219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1 U p2)))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 994 transition count 1144
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 994 transition count 1144
Applied a total of 10 rules in 31 ms. Remains 994 /999 variables (removed 5) and now considering 1144/1149 (removed 5) transitions.
// Phase 1: matrix 1144 rows 994 cols
[2023-03-19 16:18:30] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 16:18:30] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-19 16:18:30] [INFO ] Invariant cache hit.
[2023-03-19 16:18:31] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-19 16:18:31] [INFO ] Invariant cache hit.
[2023-03-19 16:18:31] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 994/999 places, 1144/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1523 ms. Remains : 994/999 places, 1144/1149 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s809 0), p2:(AND (EQ s905 1) (EQ s939 1) (EQ s960 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 871 ms.
Product exploration explored 100000 steps with 50000 reset in 872 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-030B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-030B-LTLFireability-08 finished in 3450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1 U p2)))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 998 transition count 1027
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 877 transition count 1027
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 877 transition count 877
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 727 transition count 877
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 549 place count 720 transition count 870
Iterating global reduction 2 with 7 rules applied. Total rules applied 556 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 720 transition count 869
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1148 place count 423 transition count 573
Applied a total of 1148 rules in 106 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-19 16:18:33] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:18:33] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-19 16:18:33] [INFO ] Invariant cache hit.
[2023-03-19 16:18:34] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-19 16:18:34] [INFO ] Redundant transitions in 97 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-19 16:18:34] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:18:34] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/999 places, 572/1149 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1126 ms. Remains : 423/999 places, 572/1149 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s409 0), p2:(EQ s39 1), p1:(EQ s215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 383 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-11 finished in 1272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p0&&X(p1))))))'
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 34 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:18:34] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:18:35] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-19 16:18:35] [INFO ] Invariant cache hit.
[2023-03-19 16:18:35] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2023-03-19 16:18:35] [INFO ] Invariant cache hit.
[2023-03-19 16:18:36] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1643 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=p0, acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}]], initial=9, aps=[p1:(EQ s344 1), p0:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-12 finished in 1952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&F(p1)))))'
Support contains 3 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 878 transition count 879
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 729 transition count 879
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 544 place count 723 transition count 873
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 723 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1144 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1146 place count 424 transition count 574
Applied a total of 1146 rules in 99 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-19 16:18:36] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:18:37] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-19 16:18:37] [INFO ] Invariant cache hit.
[2023-03-19 16:18:37] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-19 16:18:37] [INFO ] Redundant transitions in 104 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2023-03-19 16:18:37] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:18:37] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/999 places, 573/1149 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1154 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s382 1) (EQ s301 1)), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26937 reset in 488 ms.
Product exploration explored 100000 steps with 26996 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:18:39] [INFO ] Invariant cache hit.
[2023-03-19 16:18:39] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:18:39] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:18:39] [INFO ] [Nat]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-19 16:18:39] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:18:39] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:18:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:18:39] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:18:39] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:18:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-19 16:18:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:18:40] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-19 16:18:40] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:18:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 754 ms
[2023-03-19 16:18:40] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 16:18:40] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 424 transition count 573
Applied a total of 61 rules in 22 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 424/424 places, 573/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Finished Best-First random walk after 649 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=216 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 6 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:18:40] [INFO ] Invariant cache hit.
[2023-03-19 16:18:41] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-19 16:18:41] [INFO ] Invariant cache hit.
[2023-03-19 16:18:41] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-19 16:18:41] [INFO ] Invariant cache hit.
[2023-03-19 16:18:41] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 424/424 places, 573/573 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:18:41] [INFO ] Invariant cache hit.
[2023-03-19 16:18:42] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:18:42] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:18:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-19 16:18:42] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:18:42] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:18:42] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:18:42] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:18:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2023-03-19 16:18:42] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-19 16:18:42] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 573/573 transitions.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 61 place count 424 transition count 573
Applied a total of 61 rules in 22 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 424/424 places, 573/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 9503 steps, including 3 resets, run visited all 1 properties in 24 ms. (steps per millisecond=395 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 27219 reset in 459 ms.
Product exploration explored 100000 steps with 26957 reset in 447 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 13 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:18:44] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-19 16:18:44] [INFO ] Invariant cache hit.
[2023-03-19 16:18:44] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 424/424 places, 573/573 transitions.
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 6 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:18:44] [INFO ] Invariant cache hit.
[2023-03-19 16:18:45] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-19 16:18:45] [INFO ] Invariant cache hit.
[2023-03-19 16:18:45] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2023-03-19 16:18:45] [INFO ] Invariant cache hit.
[2023-03-19 16:18:45] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 424/424 places, 573/573 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-13 finished in 9064 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(X(!p0))) U (p1&&(p2||X((G(p1) U (p2&&G(p1))))))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 992 transition count 1142
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 992 transition count 1142
Applied a total of 14 rules in 35 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:18:45] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 16:18:46] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-19 16:18:46] [INFO ] Invariant cache hit.
[2023-03-19 16:18:46] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2023-03-19 16:18:46] [INFO ] Invariant cache hit.
[2023-03-19 16:18:47] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 992/999 places, 1142/1149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 p2), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 5}, { cond=(AND p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 5}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 5}, { cond=(AND p1 p2), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s564 1), p2:(EQ s962 1), p0:(AND (EQ s687 1) (EQ s698 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20026 reset in 391 ms.
Product exploration explored 100000 steps with 20001 reset in 359 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 643 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:18:49] [INFO ] Invariant cache hit.
[2023-03-19 16:18:49] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:18:50] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:18:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-19 16:18:51] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:18:51] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 1 ms to minimize.
[2023-03-19 16:18:51] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2023-03-19 16:18:52] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-03-19 16:18:52] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 1 ms to minimize.
[2023-03-19 16:18:52] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2023-03-19 16:18:53] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-19 16:18:53] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2023-03-19 16:18:53] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-19 16:18:54] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 0 ms to minimize.
[2023-03-19 16:18:54] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-19 16:18:54] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2023-03-19 16:18:54] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 0 ms to minimize.
[2023-03-19 16:18:55] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 0 ms to minimize.
[2023-03-19 16:18:55] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 0 ms to minimize.
[2023-03-19 16:18:55] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 1 ms to minimize.
[2023-03-19 16:18:55] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 1 ms to minimize.
[2023-03-19 16:18:56] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:18:56] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:18:56] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:18:56] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:18:56] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:18:57] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 1 ms to minimize.
[2023-03-19 16:18:57] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2023-03-19 16:18:57] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2023-03-19 16:18:57] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:18:58] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:18:58] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 0 ms to minimize.
[2023-03-19 16:18:58] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2023-03-19 16:18:58] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2023-03-19 16:18:59] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:18:59] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 1 ms to minimize.
[2023-03-19 16:18:59] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 1 ms to minimize.
[2023-03-19 16:18:59] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 1 ms to minimize.
[2023-03-19 16:18:59] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:19:00] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 1 ms to minimize.
[2023-03-19 16:19:00] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:00] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 0 ms to minimize.
[2023-03-19 16:19:00] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:19:00] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 1 ms to minimize.
[2023-03-19 16:19:01] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:01] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:01] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:19:01] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2023-03-19 16:19:01] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:19:02] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:19:02] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:19:02] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 1 ms to minimize.
[2023-03-19 16:19:02] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:19:02] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 0 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 1 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:19:03] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 1 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 0 ms to minimize.
[2023-03-19 16:19:04] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 13958 ms
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:19:05] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 0 ms to minimize.
[2023-03-19 16:19:06] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 787 ms
[2023-03-19 16:19:06] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:19:06] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2023-03-19 16:19:06] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:19:06] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 0 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 0 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 0 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 0 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 1 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 0 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7465 ms
[2023-03-19 16:19:13] [INFO ] After 22865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-19 16:19:13] [INFO ] After 23225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1022
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 872 transition count 1022
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 240 place count 872 transition count 874
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1132 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1194 place count 426 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1195 place count 425 transition count 575
Applied a total of 1195 rules in 85 ms. Remains 425 /992 variables (removed 567) and now considering 575/1142 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 249524 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249524 steps, saw 97051 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-19 16:19:17] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:19:17] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:19:17] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:19:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:19:17] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-19 16:19:17] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 16:19:17] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 425/425 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 14 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-19 16:19:18] [INFO ] Invariant cache hit.
[2023-03-19 16:19:18] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 16:19:18] [INFO ] Invariant cache hit.
[2023-03-19 16:19:18] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-19 16:19:18] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-19 16:19:18] [INFO ] Invariant cache hit.
[2023-03-19 16:19:18] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 902 ms. Remains : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 10 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-19 16:19:18] [INFO ] Invariant cache hit.
[2023-03-19 16:19:19] [INFO ] [Real]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-19 16:19:19] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:19:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-19 16:19:19] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2023-03-19 16:19:19] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-19 16:19:20] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p2))), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 834 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 552 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:19:21] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-19 16:19:22] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2023-03-19 16:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:19:24] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2023-03-19 16:19:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:19:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 60 ms returned sat
[2023-03-19 16:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:19:26] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2023-03-19 16:19:26] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 63 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:19:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-19 16:19:39] [INFO ] Invariant cache hit.
[2023-03-19 16:19:39] [INFO ] [Real]Absence check using 121 positive place invariants in 74 ms returned sat
[2023-03-19 16:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:19:41] [INFO ] [Real]Absence check using state equation in 1661 ms returned sat
[2023-03-19 16:19:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:19:41] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2023-03-19 16:19:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:19:43] [INFO ] [Nat]Absence check using state equation in 1737 ms returned sat
[2023-03-19 16:19:43] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 14 places in 423 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:19:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 21 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2023-03-19 16:19:56] [INFO ] Invariant cache hit.
[2023-03-19 16:19:57] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-19 16:19:57] [INFO ] Invariant cache hit.
[2023-03-19 16:19:57] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2023-03-19 16:19:57] [INFO ] Invariant cache hit.
[2023-03-19 16:19:58] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1559 ms. Remains : 992/992 places, 1142/1142 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/992 stabilizing places and 239/1142 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 658 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 16:19:59] [INFO ] Invariant cache hit.
[2023-03-19 16:20:00] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:20:00] [INFO ] After 435ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 1 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 0 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5492 ms
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-19 16:20:06] [INFO ] After 6491ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 16:20:06] [INFO ] After 6745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 16:20:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-19 16:20:07] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 62 places in 200 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 0 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 0 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 15 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 2 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4066 ms
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 728 ms
[2023-03-19 16:20:12] [INFO ] After 5594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-19 16:20:12] [INFO ] After 6015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 992 transition count 1022
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 872 transition count 1022
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 240 place count 872 transition count 874
Deduced a syphon composed of 148 places in 2 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 536 place count 724 transition count 874
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1132 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1194 place count 426 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1195 place count 425 transition count 575
Applied a total of 1195 rules in 82 ms. Remains 425 /992 variables (removed 567) and now considering 575/1142 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-19 16:20:13] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-19 16:20:13] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-19 16:20:13] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:20:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-19 16:20:13] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-19 16:20:13] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-19 16:20:14] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 11 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 425/425 places, 575/575 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 336691 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336691 steps, saw 112478 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:20:17] [INFO ] Invariant cache hit.
[2023-03-19 16:20:17] [INFO ] [Real]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-19 16:20:17] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:20:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-19 16:20:17] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2023-03-19 16:20:18] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 16:20:18] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 425/425 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-19 16:20:18] [INFO ] Invariant cache hit.
[2023-03-19 16:20:18] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-19 16:20:18] [INFO ] Invariant cache hit.
[2023-03-19 16:20:18] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-19 16:20:18] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-19 16:20:18] [INFO ] Invariant cache hit.
[2023-03-19 16:20:19] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 425/425 places, 575/575 transitions.
Applied a total of 0 rules in 8 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-19 16:20:19] [INFO ] Invariant cache hit.
[2023-03-19 16:20:19] [INFO ] [Real]Absence check using 121 positive place invariants in 11 ms returned sat
[2023-03-19 16:20:19] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:20:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-19 16:20:19] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2023-03-19 16:20:19] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 16:20:19] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p2))), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 894 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 580 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:20:21] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 16:20:22] [INFO ] [Real]Absence check using 121 positive place invariants in 79 ms returned sat
[2023-03-19 16:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:20:24] [INFO ] [Real]Absence check using state equation in 1751 ms returned sat
[2023-03-19 16:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:20:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 77 ms returned sat
[2023-03-19 16:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:20:26] [INFO ] [Nat]Absence check using state equation in 1732 ms returned sat
[2023-03-19 16:20:26] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-19 16:20:39] [INFO ] Deduced a trap composed of 14 places in 443 ms of which 1 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:20:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-19 16:20:39] [INFO ] Invariant cache hit.
[2023-03-19 16:20:40] [INFO ] [Real]Absence check using 121 positive place invariants in 71 ms returned sat
[2023-03-19 16:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:20:41] [INFO ] [Real]Absence check using state equation in 1699 ms returned sat
[2023-03-19 16:20:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:20:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 83 ms returned sat
[2023-03-19 16:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:20:44] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2023-03-19 16:20:44] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 80 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:20:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 625 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19982 reset in 570 ms.
Product exploration explored 100000 steps with 20053 reset in 491 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 551 ms :[(OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, p0, true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 992 transition count 1142
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 119 place count 992 transition count 1171
Deduced a syphon composed of 178 places in 2 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 178 place count 992 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 991 transition count 1170
Deduced a syphon composed of 177 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 991 transition count 1170
Performed 388 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 1 with 388 rules applied. Total rules applied 568 place count 991 transition count 1170
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 777 place count 782 transition count 961
Deduced a syphon composed of 356 places in 1 ms
Iterating global reduction 1 with 209 rules applied. Total rules applied 986 place count 782 transition count 961
Deduced a syphon composed of 356 places in 1 ms
Applied a total of 986 rules in 196 ms. Remains 782 /992 variables (removed 210) and now considering 961/1142 (removed 181) transitions.
[2023-03-19 16:20:59] [INFO ] Redundant transitions in 147 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 782 cols
[2023-03-19 16:20:59] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 16:21:00] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 782/992 places, 960/1142 transitions.
Deduced a syphon composed of 356 places in 0 ms
Applied a total of 0 rules in 21 ms. Remains 782 /782 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 854 ms. Remains : 782/992 places, 960/1142 transitions.
Support contains 4 out of 992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 992/992 places, 1142/1142 transitions.
Applied a total of 0 rules in 20 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-19 16:21:00] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:21:00] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-19 16:21:00] [INFO ] Invariant cache hit.
[2023-03-19 16:21:01] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-03-19 16:21:01] [INFO ] Invariant cache hit.
[2023-03-19 16:21:01] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 992/992 places, 1142/1142 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-14 finished in 135946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 878 transition count 879
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 729 transition count 879
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 544 place count 723 transition count 873
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 550 place count 723 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 722 transition count 872
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1144 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1146 place count 424 transition count 574
Applied a total of 1146 rules in 64 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-19 16:21:01] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:02] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-19 16:21:02] [INFO ] Invariant cache hit.
[2023-03-19 16:21:02] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-19 16:21:02] [INFO ] Redundant transitions in 71 ms returned [573]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 573 rows 424 cols
[2023-03-19 16:21:02] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:02] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/999 places, 573/1149 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1012 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(OR (NEQ s301 1) (NEQ s303 1) (NEQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 258 reset in 322 ms.
Product exploration explored 100000 steps with 267 reset in 509 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :1
Finished Best-First random walk after 845 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=281 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:21:04] [INFO ] Invariant cache hit.
[2023-03-19 16:21:05] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-19 16:21:05] [INFO ] Invariant cache hit.
[2023-03-19 16:21:05] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-19 16:21:05] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-19 16:21:05] [INFO ] Invariant cache hit.
[2023-03-19 16:21:05] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1057 ms. Remains : 424/424 places, 573/573 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/424 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Finished Best-First random walk after 4093 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=454 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 440 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 259 reset in 474 ms.
Product exploration explored 100000 steps with 262 reset in 498 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 573/573 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:21:08] [INFO ] Invariant cache hit.
[2023-03-19 16:21:08] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-19 16:21:08] [INFO ] Invariant cache hit.
[2023-03-19 16:21:08] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-19 16:21:08] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-19 16:21:08] [INFO ] Invariant cache hit.
[2023-03-19 16:21:09] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1118 ms. Remains : 424/424 places, 573/573 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-15 finished in 7430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1))) U G(p2))))'
Found a Lengthening insensitive property : ShieldRVs-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 998 transition count 1029
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 879 transition count 1029
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 238 place count 879 transition count 880
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 536 place count 730 transition count 880
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 542 place count 724 transition count 874
Iterating global reduction 2 with 6 rules applied. Total rules applied 548 place count 724 transition count 874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 548 place count 724 transition count 873
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 550 place count 723 transition count 873
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 2 with 590 rules applied. Total rules applied 1140 place count 428 transition count 578
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1142 place count 426 transition count 576
Applied a total of 1142 rules in 113 ms. Remains 426 /999 variables (removed 573) and now considering 576/1149 (removed 573) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-19 16:21:09] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-19 16:21:09] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-19 16:21:09] [INFO ] Invariant cache hit.
[2023-03-19 16:21:10] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-19 16:21:10] [INFO ] Invariant cache hit.
[2023-03-19 16:21:10] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 426/999 places, 576/1149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1298 ms. Remains : 426/999 places, 576/1149 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s92 1), p0:(AND (EQ s20 1) (EQ s22 1) (EQ s26 1)), p1:(NEQ s160 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 244 reset in 473 ms.
Product exploration explored 100000 steps with 244 reset in 404 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 583 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:21:12] [INFO ] Invariant cache hit.
[2023-03-19 16:21:12] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-19 16:21:13] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-19 16:21:13] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-19 16:21:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:21:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-19 16:21:13] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 16:21:13] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 41 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502261 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502261 steps, saw 324737 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-19 16:21:16] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-19 16:21:16] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-19 16:21:17] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-19 16:21:17] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:17] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:21:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-19 16:21:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-19 16:21:17] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 16:21:17] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-19 16:21:17] [INFO ] Invariant cache hit.
[2023-03-19 16:21:17] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-19 16:21:17] [INFO ] Invariant cache hit.
[2023-03-19 16:21:18] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2023-03-19 16:21:18] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-19 16:21:18] [INFO ] Invariant cache hit.
[2023-03-19 16:21:19] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1481 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:21:19] [INFO ] Invariant cache hit.
[2023-03-19 16:21:19] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-19 16:21:19] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-19 16:21:19] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:19] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:21:19] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:21:19] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:21:19] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:21:19] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:21:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 380 ms
[2023-03-19 16:21:19] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:21:20] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 639 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-19 16:21:20] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-19 16:21:21] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:21] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-19 16:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:21:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-19 16:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:22] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-19 16:21:22] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 33 ms.
[2023-03-19 16:21:27] [INFO ] Added : 475 causal constraints over 95 iterations in 4980 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-19 16:21:27] [INFO ] Invariant cache hit.
[2023-03-19 16:21:27] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-19 16:21:27] [INFO ] Invariant cache hit.
[2023-03-19 16:21:28] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-19 16:21:28] [INFO ] Invariant cache hit.
[2023-03-19 16:21:28] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 426/426 places, 576/576 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/426 stabilizing places and 4/576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:21:29] [INFO ] Invariant cache hit.
[2023-03-19 16:21:29] [INFO ] [Real]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-19 16:21:29] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-19 16:21:29] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:29] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-19 16:21:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-19 16:21:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-03-19 16:21:29] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 16:21:29] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 576/576 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 425 transition count 575
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 64 place count 425 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 424 transition count 574
Applied a total of 65 rules in 38 ms. Remains 424 /426 variables (removed 2) and now considering 574/576 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437193 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437193 steps, saw 312165 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-19 16:21:32] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:21:33] [INFO ] [Real]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-19 16:21:33] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-19 16:21:33] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:33] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:21:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-19 16:21:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-19 16:21:33] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 16:21:33] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 424/424 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-19 16:21:33] [INFO ] Invariant cache hit.
[2023-03-19 16:21:33] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-19 16:21:33] [INFO ] Invariant cache hit.
[2023-03-19 16:21:34] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-19 16:21:34] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-19 16:21:34] [INFO ] Invariant cache hit.
[2023-03-19 16:21:34] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1252 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:21:34] [INFO ] Invariant cache hit.
[2023-03-19 16:21:34] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-19 16:21:35] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:21:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-19 16:21:35] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:21:35] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:21:35] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-19 16:21:35] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2023-03-19 16:21:35] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2023-03-19 16:21:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-19 16:21:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2023-03-19 16:21:35] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 16:21:35] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p2), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 532 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-19 16:21:36] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 16:21:36] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-19 16:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:37] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-19 16:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:21:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 16:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:37] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-19 16:21:38] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 36 ms.
[2023-03-19 16:21:43] [INFO ] Added : 475 causal constraints over 95 iterations in 5719 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 244 reset in 550 ms.
Product exploration explored 100000 steps with 244 reset in 566 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-19 16:21:45] [INFO ] Redundant transitions in 103 ms returned [575]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 575 rows 426 cols
[2023-03-19 16:21:45] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:45] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/426 places, 575/576 transitions.
Applied a total of 0 rules in 10 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 430 ms. Remains : 426/426 places, 575/576 transitions.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 576/576 transitions.
Applied a total of 0 rules in 5 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-19 16:21:45] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:45] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 16:21:45] [INFO ] Invariant cache hit.
[2023-03-19 16:21:46] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-19 16:21:46] [INFO ] Invariant cache hit.
[2023-03-19 16:21:46] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 426/426 places, 576/576 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 37400 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(X((p0||X(X(X(F(p1))))||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldRVs-PT-030B-LTLFireability-07
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 999/999 places, 1149/1149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 998 transition count 1028
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 878 transition count 1028
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 240 place count 878 transition count 877
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 542 place count 727 transition count 877
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 549 place count 720 transition count 870
Iterating global reduction 2 with 7 rules applied. Total rules applied 556 place count 720 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 720 transition count 869
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 719 transition count 869
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1146 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1148 place count 423 transition count 573
Applied a total of 1148 rules in 68 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-19 16:21:46] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:47] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-19 16:21:47] [INFO ] Invariant cache hit.
[2023-03-19 16:21:47] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-19 16:21:47] [INFO ] Invariant cache hit.
[2023-03-19 16:21:47] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 423/999 places, 573/1149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 884 ms. Remains : 423/999 places, 573/1149 transitions.
Running random walk in product with property : ShieldRVs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26852 reset in 503 ms.
Product exploration explored 100000 steps with 26947 reset in 487 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/573 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 18 ms :[(NOT p0)]
[2023-03-19 16:21:49] [INFO ] Invariant cache hit.
[2023-03-19 16:21:49] [INFO ] [Real]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-19 16:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:49] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-19 16:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:21:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-19 16:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:50] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-19 16:21:50] [INFO ] Computed and/alt/rep : 505/2162/505 causal constraints (skipped 66 transitions) in 26 ms.
[2023-03-19 16:21:55] [INFO ] Added : 499 causal constraints over 100 iterations in 4959 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 18 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-19 16:21:55] [INFO ] Invariant cache hit.
[2023-03-19 16:21:55] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-19 16:21:55] [INFO ] Invariant cache hit.
[2023-03-19 16:21:55] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-19 16:21:55] [INFO ] Redundant transitions in 89 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2023-03-19 16:21:55] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-19 16:21:56] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/423 places, 572/573 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1031 ms. Remains : 423/423 places, 572/573 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/423 stabilizing places and 2/572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-19 16:21:56] [INFO ] Invariant cache hit.
[2023-03-19 16:21:56] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-19 16:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:57] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-19 16:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:21:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-19 16:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:21:57] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-19 16:21:57] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 28 ms.
[2023-03-19 16:22:02] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-19 16:22:02] [INFO ] Added : 498 causal constraints over 100 iterations in 5179 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26954 reset in 501 ms.
Product exploration explored 100000 steps with 27119 reset in 559 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 572/572 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-19 16:22:03] [INFO ] Invariant cache hit.
[2023-03-19 16:22:04] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-19 16:22:04] [INFO ] Invariant cache hit.
[2023-03-19 16:22:04] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-19 16:22:04] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-19 16:22:04] [INFO ] Invariant cache hit.
[2023-03-19 16:22:05] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1079 ms. Remains : 423/423 places, 572/572 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 18416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!p0))) U (p1&&(p2||X((G(p1) U (p2&&G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2023-03-19 16:22:05] [INFO ] Flatten gal took : 82 ms
[2023-03-19 16:22:05] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 999 places, 1149 transitions and 3912 arcs took 19 ms.
Total runtime 333748 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-030B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA ShieldRVs-PT-030B-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-030B-LTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679243061151

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 16 (type EXCL) for 15 ShieldRVs-PT-030B-LTLFireability-15
lola: time limit : 599 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-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 5/599 12/32 ShieldRVs-PT-030B-LTLFireability-15 954055 m, 190811 m/sec, 1816369 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL EXCL 10/599 23/32 ShieldRVs-PT-030B-LTLFireability-15 1952560 m, 199701 m/sec, 3826778 t fired, .

Time elapsed: 11 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 16 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 13 (type EXCL) for 12 ShieldRVs-PT-030B-LTLFireability-14
lola: time limit : 716 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-14
lola: result : false
lola: markings : 13336
lola: fired transitions : 41139
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldRVs-PT-030B-LTLFireability-07
lola: time limit : 896 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/896 6/32 ShieldRVs-PT-030B-LTLFireability-07 253608 m, 50721 m/sec, 800821 t fired, .

Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/896 11/32 ShieldRVs-PT-030B-LTLFireability-07 530096 m, 55297 m/sec, 1771631 t fired, .

Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/896 16/32 ShieldRVs-PT-030B-LTLFireability-07 787442 m, 51469 m/sec, 2689953 t fired, .

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/896 21/32 ShieldRVs-PT-030B-LTLFireability-07 1045592 m, 51630 m/sec, 3592381 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/896 26/32 ShieldRVs-PT-030B-LTLFireability-07 1298658 m, 50613 m/sec, 4495700 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/896 31/32 ShieldRVs-PT-030B-LTLFireability-07 1546610 m, 49590 m/sec, 5424166 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 7 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVs-PT-030B-LTLFireability-05
lola: time limit : 1183 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-05
lola: result : true
lola: markings : 168
lola: fired transitions : 424
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-030B-LTLFireability-04
lola: time limit : 1774 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1774 4/32 ShieldRVs-PT-030B-LTLFireability-04 170374 m, 34074 m/sec, 995770 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1774 7/32 ShieldRVs-PT-030B-LTLFireability-04 330310 m, 31987 m/sec, 2077358 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1774 10/32 ShieldRVs-PT-030B-LTLFireability-04 480460 m, 30030 m/sec, 3168934 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1774 13/32 ShieldRVs-PT-030B-LTLFireability-04 621800 m, 28268 m/sec, 4316747 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1774 16/32 ShieldRVs-PT-030B-LTLFireability-04 779164 m, 31472 m/sec, 5465911 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1774 19/32 ShieldRVs-PT-030B-LTLFireability-04 938611 m, 31889 m/sec, 6619511 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1774 23/32 ShieldRVs-PT-030B-LTLFireability-04 1115160 m, 35309 m/sec, 7768908 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1774 26/32 ShieldRVs-PT-030B-LTLFireability-04 1270067 m, 30981 m/sec, 8917344 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1774 29/32 ShieldRVs-PT-030B-LTLFireability-04 1419331 m, 29852 m/sec, 10068683 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1774 32/32 ShieldRVs-PT-030B-LTLFireability-04 1565002 m, 29134 m/sec, 11223712 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldRVs-PT-030B-LTLFireability-13
lola: time limit : 3494 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/3494 7/32 ShieldRVs-PT-030B-LTLFireability-13 715868 m, 143173 m/sec, 1292708 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/3494 12/32 ShieldRVs-PT-030B-LTLFireability-13 1420780 m, 140982 m/sec, 2636143 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/3494 19/32 ShieldRVs-PT-030B-LTLFireability-13 2153856 m, 146615 m/sec, 4141248 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/3494 25/32 ShieldRVs-PT-030B-LTLFireability-13 2907588 m, 150746 m/sec, 5625772 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/3494 30/32 ShieldRVs-PT-030B-LTLFireability-13 3579029 m, 134288 m/sec, 6936075 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 10 (type EXCL) for ShieldRVs-PT-030B-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-030B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-030B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-LTLFireability-04: LTL unknown AGGR
ShieldRVs-PT-030B-LTLFireability-05: LTL true LTL model checker
ShieldRVs-PT-030B-LTLFireability-07: LTL unknown AGGR
ShieldRVs-PT-030B-LTLFireability-13: LTL unknown AGGR
ShieldRVs-PT-030B-LTLFireability-14: LTL false LTL model checker
ShieldRVs-PT-030B-LTLFireability-15: LTL unknown AGGR


Time elapsed: 136 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-030B"
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-030B, 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-167905976300124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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