Execution Chart

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

Trace from the execution

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

--------------------
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 1679298890960

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:54:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:54:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:54:53] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-20 07:54:53] [INFO ] Transformed 1203 places.
[2023-03-20 07:54:53] [INFO ] Transformed 1353 transitions.
[2023-03-20 07:54:53] [INFO ] Found NUPN structural information;
[2023-03-20 07:54:53] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 196 ms. Remains 999 /1203 variables (removed 204) and now considering 1149/1353 (removed 204) transitions.
// Phase 1: matrix 1149 rows 999 cols
[2023-03-20 07:54:53] [INFO ] Computed 121 place invariants in 31 ms
[2023-03-20 07:54:53] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-20 07:54:53] [INFO ] Invariant cache hit.
[2023-03-20 07:54:54] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2023-03-20 07:54:54] [INFO ] Invariant cache hit.
[2023-03-20 07:54:55] [INFO ] Dead Transitions using invariants and state equation in 467 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 2014 ms. Remains : 999/1203 places, 1149/1353 transitions.
Support contains 53 out of 999 places after structural reductions.
[2023-03-20 07:54:55] [INFO ] Flatten gal took : 110 ms
[2023-03-20 07:54:55] [INFO ] Flatten gal took : 61 ms
[2023-03-20 07:54:55] [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 525 ms. (steps per millisecond=19 ) properties (out of 30) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 07:54:56] [INFO ] Invariant cache hit.
[2023-03-20 07:54:56] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-20 07:54:56] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:54:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-20 07:54:57] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:54:57] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 6 ms to minimize.
[2023-03-20 07:54:57] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 1 ms to minimize.
[2023-03-20 07:54:58] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:54:58] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 1 ms to minimize.
[2023-03-20 07:54:58] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:54:59] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 1 ms to minimize.
[2023-03-20 07:54:59] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2023-03-20 07:54:59] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 1 ms to minimize.
[2023-03-20 07:54:59] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 0 ms to minimize.
[2023-03-20 07:55:00] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2023-03-20 07:55:00] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 1 ms to minimize.
[2023-03-20 07:55:00] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 1 ms to minimize.
[2023-03-20 07:55:00] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 1 ms to minimize.
[2023-03-20 07:55:01] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2023-03-20 07:55:01] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 0 ms to minimize.
[2023-03-20 07:55:01] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 1 ms to minimize.
[2023-03-20 07:55:01] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 1 ms to minimize.
[2023-03-20 07:55:02] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 1 ms to minimize.
[2023-03-20 07:55:02] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2023-03-20 07:55:02] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 0 ms to minimize.
[2023-03-20 07:55:02] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 2 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2023-03-20 07:55:03] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 7089 ms
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:55:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2023-03-20 07:55:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 909 ms
[2023-03-20 07:55:05] [INFO ] After 9017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-20 07:55:06] [INFO ] After 9416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 10 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 1149/1149 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 999 transition count 1030
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 880 transition count 1030
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 880 transition count 880
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 730 transition count 880
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 542 place count 726 transition count 876
Iterating global reduction 2 with 4 rules applied. Total rules applied 546 place count 726 transition count 876
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 1142 place count 428 transition count 578
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 1201 place count 428 transition count 578
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1202 place count 427 transition count 577
Applied a total of 1202 rules in 315 ms. Remains 427 /999 variables (removed 572) and now considering 577/1149 (removed 572) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 427/999 places, 577/1149 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 577 rows 427 cols
[2023-03-20 07:55:06] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:55:06] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 07:55:07] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-20 07:55:07] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:07] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-20 07:55:07] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 577/577 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 426 transition count 576
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 426 transition count 575
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 425 transition count 575
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 423 transition count 573
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 423 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 422 transition count 572
Applied a total of 11 rules in 130 ms. Remains 422 /427 variables (removed 5) and now considering 572/577 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 422/427 places, 572/577 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished Best-First random walk after 639 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=213 )
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 80 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-20 07:55:07] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 07:55:08] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-20 07:55:08] [INFO ] Invariant cache hit.
[2023-03-20 07:55:09] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-03-20 07:55:09] [INFO ] Invariant cache hit.
[2023-03-20 07:55:09] [INFO ] Dead Transitions using invariants and state equation in 469 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 1786 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 269 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 1 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-00 finished in 2130 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 45 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-20 07:55:10] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 07:55:10] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-20 07:55:10] [INFO ] Invariant cache hit.
[2023-03-20 07:55:11] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-20 07:55:11] [INFO ] Invariant cache hit.
[2023-03-20 07:55:11] [INFO ] Dead Transitions using invariants and state equation in 495 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 1650 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 144 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 1258 steps with 0 reset in 16 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-01 finished in 1832 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 41 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-20 07:55:11] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:55:12] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-20 07:55:12] [INFO ] Invariant cache hit.
[2023-03-20 07:55:12] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-20 07:55:12] [INFO ] Invariant cache hit.
[2023-03-20 07:55:13] [INFO ] Dead Transitions using invariants and state equation in 540 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 1574 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 102 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 541 ms.
Product exploration explored 100000 steps with 77 reset in 508 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 420 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 129 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 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:55:15] [INFO ] Invariant cache hit.
[2023-03-20 07:55:15] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-20 07:55:15] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-20 07:55:16] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:16] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2023-03-20 07:55:16] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 2 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 0 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2023-03-20 07:55:17] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2023-03-20 07:55:18] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 1 ms to minimize.
[2023-03-20 07:55:18] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-20 07:55:18] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 1 ms to minimize.
[2023-03-20 07:55:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2013 ms
[2023-03-20 07:55:18] [INFO ] After 2433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 07:55:18] [INFO ] After 2651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 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 0 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 129 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 131 ms. Remains : 424/993 places, 574/1143 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 445551 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445551 steps, saw 273027 distinct states, run finished after 3007 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-20 07:55:21] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-20 07:55:21] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 07:55:22] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:55:22] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-20 07:55:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2023-03-20 07:55:22] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:55:22] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:55:22] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-20 07:55:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 375 ms
[2023-03-20 07:55:22] [INFO ] After 578ms 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-20 07:55:22] [INFO ] After 698ms 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 23 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 24 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 13 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-20 07:55:22] [INFO ] Invariant cache hit.
[2023-03-20 07:55:23] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-20 07:55:23] [INFO ] Invariant cache hit.
[2023-03-20 07:55:23] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-20 07:55:23] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-20 07:55:23] [INFO ] Invariant cache hit.
[2023-03-20 07:55:23] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 958 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 13 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:55:23] [INFO ] Invariant cache hit.
[2023-03-20 07:55:23] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 07:55:23] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 07:55:24] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-20 07:55:24] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:55:24] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-20 07:55:24] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-20 07:55:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 289 ms
[2023-03-20 07:55:24] [INFO ] After 450ms 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-20 07:55:24] [INFO ] After 549ms 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 362 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 104 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 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-20 07:55:25] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:55:25] [INFO ] [Real]Absence check using 121 positive place invariants in 89 ms returned sat
[2023-03-20 07:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:55:27] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2023-03-20 07:55:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:55:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 65 ms returned sat
[2023-03-20 07:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:55:30] [INFO ] [Nat]Absence check using state equation in 2116 ms returned sat
[2023-03-20 07:55:30] [INFO ] Computed and/alt/rep : 1142/3615/1142 causal constraints (skipped 0 transitions) in 88 ms.
[2023-03-20 07:55:42] [INFO ] Added : 530 causal constraints over 106 iterations in 12381 ms. Result :unknown
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 2 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 0 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 145 ms. Remains 426 /993 variables (removed 567) and now considering 576/1143 (removed 567) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-20 07:55:42] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:55:43] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-20 07:55:43] [INFO ] Invariant cache hit.
[2023-03-20 07:55:43] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-20 07:55:43] [INFO ] Redundant transitions in 137 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-20 07:55:43] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:55:44] [INFO ] Dead Transitions using invariants and state equation in 327 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 14 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 1417 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 607 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 129 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:55:44] [INFO ] Invariant cache hit.
[2023-03-20 07:55:45] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-20 07:55:45] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 07:55:45] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-20 07:55:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-20 07:55:45] [INFO ] After 374ms 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-20 07:55:45] [INFO ] After 490ms 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 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 46 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 46 ms. Remains : 424/426 places, 573/575 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
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
Interrupted probabilistic random walk after 483992 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 483992 steps, saw 275296 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 573 rows 424 cols
[2023-03-20 07:55:48] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:55:49] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2023-03-20 07:55:49] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-20 07:55:49] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:55:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 510 ms
[2023-03-20 07:55:50] [INFO ] After 703ms 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-20 07:55:50] [INFO ] After 810ms 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, 573/573 transitions.
Applied a total of 0 rules in 16 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 16 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-20 07:55:50] [INFO ] Invariant cache hit.
[2023-03-20 07:55:50] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-20 07:55:50] [INFO ] Invariant cache hit.
[2023-03-20 07:55:50] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2023-03-20 07:55:50] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-20 07:55:50] [INFO ] Invariant cache hit.
[2023-03-20 07:55:51] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1131 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-20 07:55:51] [INFO ] Invariant cache hit.
[2023-03-20 07:55:51] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 07:55:51] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:55:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 07:55:51] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:55:51] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 07:55:51] [INFO ] After 295ms 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 566 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 132 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 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-20 07:55:52] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:55:52] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-20 07:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:55:53] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-20 07:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:55:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-20 07:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:55:54] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2023-03-20 07:55:54] [INFO ] Computed and/alt/rep : 503/2158/503 causal constraints (skipped 68 transitions) in 42 ms.
[2023-03-20 07:56:00] [INFO ] Added : 478 causal constraints over 96 iterations in 6080 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 244 reset in 525 ms.
Product exploration explored 100000 steps with 244 reset in 645 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 15 ms. Remains 426 /426 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-20 07:56:01] [INFO ] Invariant cache hit.
[2023-03-20 07:56:01] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-20 07:56:01] [INFO ] Invariant cache hit.
[2023-03-20 07:56:02] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-20 07:56:02] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-20 07:56:02] [INFO ] Invariant cache hit.
[2023-03-20 07:56:02] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1250 ms. Remains : 426/426 places, 575/575 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 51104 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 59 ms. Remains 993 /999 variables (removed 6) and now considering 1143/1149 (removed 6) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-20 07:56:02] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 07:56:03] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-20 07:56:03] [INFO ] Invariant cache hit.
[2023-03-20 07:56:04] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2023-03-20 07:56:04] [INFO ] Invariant cache hit.
[2023-03-20 07:56:04] [INFO ] Dead Transitions using invariants and state equation in 574 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 1738 ms. Remains : 993/999 places, 1143/1149 transitions.
Stuttering acceptance computed with spot in 322 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 442 ms.
Product exploration explored 100000 steps with 14285 reset in 332 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 170 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 461 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 9981 steps, including 7 resets, run visited all 6 properties in 65 ms. (steps per millisecond=153 )
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 249 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 621 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 563 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 46 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2023-03-20 07:56:07] [INFO ] Invariant cache hit.
[2023-03-20 07:56:08] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-20 07:56:08] [INFO ] Invariant cache hit.
[2023-03-20 07:56:09] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-20 07:56:09] [INFO ] Invariant cache hit.
[2023-03-20 07:56:10] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2454 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 133 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 579 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))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:56:11] [INFO ] Invariant cache hit.
[2023-03-20 07:56:11] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:56:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-20 07:56:12] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:56:12] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 0 ms to minimize.
[2023-03-20 07:56:12] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 0 ms to minimize.
[2023-03-20 07:56:12] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 1 ms to minimize.
[2023-03-20 07:56:13] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-20 07:56:13] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 0 ms to minimize.
[2023-03-20 07:56:13] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 0 ms to minimize.
[2023-03-20 07:56:13] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-03-20 07:56:13] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 0 ms to minimize.
[2023-03-20 07:56:14] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2023-03-20 07:56:14] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-20 07:56:14] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2023-03-20 07:56:14] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 0 ms to minimize.
[2023-03-20 07:56:15] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2023-03-20 07:56:15] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 0 ms to minimize.
[2023-03-20 07:56:15] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 0 ms to minimize.
[2023-03-20 07:56:15] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 0 ms to minimize.
[2023-03-20 07:56:15] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 0 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 1 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 1 ms to minimize.
[2023-03-20 07:56:16] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:56:17] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2023-03-20 07:56:17] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 0 ms to minimize.
[2023-03-20 07:56:17] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:56:17] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 1 ms to minimize.
[2023-03-20 07:56:17] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:56:18] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 1 ms to minimize.
[2023-03-20 07:56:18] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 0 ms to minimize.
[2023-03-20 07:56:18] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 0 ms to minimize.
[2023-03-20 07:56:18] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6371 ms
[2023-03-20 07:56:18] [INFO ] After 6852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-20 07:56:18] [INFO ] After 7077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 1143/1143 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 993 transition count 1023
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 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 240 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 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 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1138 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 2 with 61 rules applied. Total rules applied 1199 place count 424 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1200 place count 423 transition count 573
Applied a total of 1200 rules in 107 ms. Remains 423 /993 variables (removed 570) and now considering 573/1143 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 423/993 places, 573/1143 transitions.
Finished random walk after 280 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
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 363 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 489 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 448 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 454 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 392 ms.
Product exploration explored 100000 steps with 14285 reset in 400 ms.
Applying partial POR strategy [true, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 465 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 2 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 1 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 282 ms. Remains 784 /993 variables (removed 209) and now considering 963/1143 (removed 180) transitions.
[2023-03-20 07:56:22] [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-20 07:56:22] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-20 07:56:22] [INFO ] Dead Transitions using invariants and state equation in 512 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 33 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 1021 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 51 ms. Remains 993 /993 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2023-03-20 07:56:23] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 07:56:23] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-20 07:56:23] [INFO ] Invariant cache hit.
[2023-03-20 07:56:24] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-20 07:56:24] [INFO ] Invariant cache hit.
[2023-03-20 07:56:25] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 993/993 places, 1143/1143 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-05 finished in 22400 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 57 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-20 07:56:25] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 07:56:31] [INFO ] Implicit Places using invariants in 6421 ms returned []
[2023-03-20 07:56:31] [INFO ] Invariant cache hit.
[2023-03-20 07:56:32] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 7190 ms to find 0 implicit places.
[2023-03-20 07:56:32] [INFO ] Invariant cache hit.
[2023-03-20 07:56:33] [INFO ] Dead Transitions using invariants and state equation in 707 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 7960 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 84 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 8069 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 42 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
[2023-03-20 07:56:33] [INFO ] Invariant cache hit.
[2023-03-20 07:56:33] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-20 07:56:33] [INFO ] Invariant cache hit.
[2023-03-20 07:56:34] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-20 07:56:34] [INFO ] Invariant cache hit.
[2023-03-20 07:56:35] [INFO ] Dead Transitions using invariants and state equation in 858 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 2051 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 70 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 214 reset in 428 ms.
Product exploration explored 100000 steps with 216 reset in 406 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 217 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 28 ms :[(NOT p0)]
Finished random walk after 438 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=146 )
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 161 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-20 07:56:36] [INFO ] Invariant cache hit.
[2023-03-20 07:56:37] [INFO ] [Real]Absence check using 121 positive place invariants in 75 ms returned sat
[2023-03-20 07:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:56:39] [INFO ] [Real]Absence check using state equation in 2107 ms returned sat
[2023-03-20 07:56:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:56:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 130 ms returned sat
[2023-03-20 07:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:56:43] [INFO ] [Nat]Absence check using state equation in 2803 ms returned sat
[2023-03-20 07:56:43] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 114 ms.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 14 places in 433 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: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-20 07:56:55] [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 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 1 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 78 ms. Remains 423 /992 variables (removed 569) and now considering 573/1142 (removed 569) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-20 07:56:55] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 07:56:55] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-20 07:56:55] [INFO ] Invariant cache hit.
[2023-03-20 07:56:55] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-20 07:56:56] [INFO ] Redundant transitions in 110 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-20 07:56:56] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:56:56] [INFO ] Dead Transitions using invariants and state equation in 266 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 12 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 1183 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 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 27 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 147 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-20 07:56:56] [INFO ] Invariant cache hit.
[2023-03-20 07:56:56] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-20 07:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:56:57] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-20 07:56:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:56:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 07:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:56:58] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-20 07:56:58] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 47 ms.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-20 07:57:04] [INFO ] Added : 483 causal constraints over 98 iterations in 6169 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27191 reset in 588 ms.
Product exploration explored 100000 steps with 26983 reset in 572 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 11 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-20 07:57:05] [INFO ] Invariant cache hit.
[2023-03-20 07:57:05] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-20 07:57:05] [INFO ] Invariant cache hit.
[2023-03-20 07:57:06] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-20 07:57:06] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-20 07:57:06] [INFO ] Invariant cache hit.
[2023-03-20 07:57:06] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1072 ms. Remains : 423/423 places, 572/572 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 33179 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 36 ms. Remains 994 /999 variables (removed 5) and now considering 1144/1149 (removed 5) transitions.
// Phase 1: matrix 1144 rows 994 cols
[2023-03-20 07:57:06] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:57:06] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-20 07:57:06] [INFO ] Invariant cache hit.
[2023-03-20 07:57:07] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-20 07:57:07] [INFO ] Invariant cache hit.
[2023-03-20 07:57:08] [INFO ] Dead Transitions using invariants and state equation in 617 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 1723 ms. Remains : 994/999 places, 1144/1149 transitions.
Stuttering acceptance computed with spot in 112 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 770 ms.
Product exploration explored 100000 steps with 50000 reset in 715 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 98 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 3455 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 2 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 1 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 158 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-20 07:57:10] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 07:57:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-20 07:57:10] [INFO ] Invariant cache hit.
[2023-03-20 07:57:10] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-20 07:57:10] [INFO ] Redundant transitions in 131 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-20 07:57:10] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 07:57:11] [INFO ] Dead Transitions using invariants and state equation in 305 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 11 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 1256 ms. Remains : 423/999 places, 572/1149 transitions.
Stuttering acceptance computed with spot in 166 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 3 ms.
FORMULA ShieldRVs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLFireability-11 finished in 1455 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 46 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-20 07:57:11] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-20 07:57:12] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-20 07:57:12] [INFO ] Invariant cache hit.
[2023-03-20 07:57:12] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2023-03-20 07:57:12] [INFO ] Invariant cache hit.
[2023-03-20 07:57:13] [INFO ] Dead Transitions using invariants and state equation in 865 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 2308 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 490 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 2831 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 2 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 133 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-20 07:57:14] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:57:14] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 07:57:14] [INFO ] Invariant cache hit.
[2023-03-20 07:57:15] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-20 07:57:15] [INFO ] Redundant transitions in 147 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-20 07:57:15] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 07:57:15] [INFO ] Dead Transitions using invariants and state equation in 347 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 9 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 1442 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 113 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 27232 reset in 600 ms.
Product exploration explored 100000 steps with 27125 reset in 604 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 242 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 85 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Finished Best-First random walk after 4195 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=279 )
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 380 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 88 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 118 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 12 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 07:57:18] [INFO ] Invariant cache hit.
[2023-03-20 07:57:18] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-20 07:57:18] [INFO ] Invariant cache hit.
[2023-03-20 07:57:18] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-20 07:57:18] [INFO ] Invariant cache hit.
[2023-03-20 07:57:19] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1033 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 272 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 144 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:57:19] [INFO ] Invariant cache hit.
[2023-03-20 07:57:19] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-20 07:57:20] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:57:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-20 07:57:20] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2023-03-20 07:57:20] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 07:57:20] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 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 37 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 37 ms. Remains : 424/424 places, 573/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Finished Best-First random walk after 9791 steps, including 3 resets, run visited all 1 properties in 40 ms. (steps per millisecond=244 )
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 282 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 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 27112 reset in 632 ms.
Product exploration explored 100000 steps with 27259 reset in 625 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 122 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 18 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 07:57:23] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-20 07:57:23] [INFO ] Invariant cache hit.
[2023-03-20 07:57:23] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 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-20 07:57:23] [INFO ] Invariant cache hit.
[2023-03-20 07:57:24] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-20 07:57:24] [INFO ] Invariant cache hit.
[2023-03-20 07:57:24] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-20 07:57:24] [INFO ] Invariant cache hit.
[2023-03-20 07:57:24] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1117 ms. Remains : 424/424 places, 573/573 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-13 finished in 10760 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 41 ms. Remains 992 /999 variables (removed 7) and now considering 1142/1149 (removed 7) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-20 07:57:25] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 07:57:25] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-20 07:57:25] [INFO ] Invariant cache hit.
[2023-03-20 07:57:26] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-20 07:57:26] [INFO ] Invariant cache hit.
[2023-03-20 07:57:26] [INFO ] Dead Transitions using invariants and state equation in 535 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 1662 ms. Remains : 992/999 places, 1142/1149 transitions.
Stuttering acceptance computed with spot in 660 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 19941 reset in 405 ms.
Product exploration explored 100000 steps with 19988 reset in 372 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 942 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 834 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 276 ms. (steps per millisecond=36 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:57:30] [INFO ] Invariant cache hit.
[2023-03-20 07:57:30] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-20 07:57:31] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:57:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-20 07:57:32] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 1 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 0 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 0 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 1 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 0 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 0 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 1 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 0 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 1 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 1 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 1 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 1 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 1 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 0 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 3 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 0 ms to minimize.
[2023-03-20 07:57:41] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 1 ms to minimize.
[2023-03-20 07:57:41] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 2 ms to minimize.
[2023-03-20 07:57:41] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 0 ms to minimize.
[2023-03-20 07:57:42] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-20 07:57:42] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 0 ms to minimize.
[2023-03-20 07:57:42] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2023-03-20 07:57:42] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 1 ms to minimize.
[2023-03-20 07:57:43] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 1 ms to minimize.
[2023-03-20 07:57:43] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 1 ms to minimize.
[2023-03-20 07:57:43] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 1 ms to minimize.
[2023-03-20 07:57:43] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 0 ms to minimize.
[2023-03-20 07:57:45] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 0 ms to minimize.
[2023-03-20 07:57:45] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 1 ms to minimize.
[2023-03-20 07:57:45] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 0 ms to minimize.
[2023-03-20 07:57:45] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 1 ms to minimize.
[2023-03-20 07:57:46] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 0 ms to minimize.
[2023-03-20 07:57:46] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 1 ms to minimize.
[2023-03-20 07:57:46] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 0 ms to minimize.
[2023-03-20 07:57:46] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2023-03-20 07:57:47] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 1 ms to minimize.
[2023-03-20 07:57:47] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 1 ms to minimize.
[2023-03-20 07:57:47] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 1 ms to minimize.
[2023-03-20 07:57:47] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 0 ms to minimize.
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 0 ms to minimize.
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 1 ms to minimize.
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 1 ms to minimize.
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 1 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 17436 ms
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 1 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 1 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1243 ms
[2023-03-20 07:57:51] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 0 ms to minimize.
[2023-03-20 07:57:51] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:57:51] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 0 ms to minimize.
[2023-03-20 07:57:51] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-20 07:57:51] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 0 ms to minimize.
[2023-03-20 07:57:52] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-20 07:57:52] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 0 ms to minimize.
[2023-03-20 07:57:52] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 0 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 1 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 0 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 0 ms to minimize.
[2023-03-20 07:57:55] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 0 ms to minimize.
[2023-03-20 07:57:55] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-20 07:57:55] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 0 ms to minimize.
[2023-03-20 07:57:55] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 1 ms to minimize.
[2023-03-20 07:57:56] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 0 ms to minimize.
[2023-03-20 07:57:56] [INFO ] Deduced a trap composed of 38 places in 179 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 07:57:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:57:56] [INFO ] After 25089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 69 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 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 80 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 80 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) 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
Interrupted probabilistic random walk after 249031 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 249031 steps, saw 96947 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-20 07:57:59] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:57:59] [INFO ] [Real]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-20 07:58:00] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:58:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-20 07:58:00] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:58:00] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-20 07:58:00] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 07:58:00] [INFO ] After 618ms 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 10 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 10 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 10 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 9 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-20 07:58:00] [INFO ] Invariant cache hit.
[2023-03-20 07:58:00] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-20 07:58:01] [INFO ] Invariant cache hit.
[2023-03-20 07:58:01] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-20 07:58:01] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 07:58:01] [INFO ] Invariant cache hit.
[2023-03-20 07:58:01] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 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.
Running SMT prover for 3 properties.
[2023-03-20 07:58:01] [INFO ] Invariant cache hit.
[2023-03-20 07:58:01] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:58:02] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:58:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:58:02] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:58:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 245 ms
[2023-03-20 07:58:03] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-20 07:58:03] [INFO ] After 960ms 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 1017 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 570 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 656 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-20 07:58:05] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-20 07:58:06] [INFO ] [Real]Absence check using 121 positive place invariants in 131 ms returned sat
[2023-03-20 07:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:58:09] [INFO ] [Real]Absence check using state equation in 3006 ms returned sat
[2023-03-20 07:58:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:58:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 69 ms returned sat
[2023-03-20 07:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:58:11] [INFO ] [Nat]Absence check using state equation in 1812 ms returned sat
[2023-03-20 07:58:12] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 106 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-20 07:58:24] [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-20 07:58:24] [INFO ] Invariant cache hit.
[2023-03-20 07:58:25] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-20 07:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:58:28] [INFO ] [Real]Absence check using state equation in 2483 ms returned sat
[2023-03-20 07:58:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:58:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 94 ms returned sat
[2023-03-20 07:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:58:31] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2023-03-20 07:58:31] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 96 ms.
[2023-03-20 07:58:43] [INFO ] Added : 455 causal constraints over 91 iterations in 11923 ms. Result :unknown
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 23 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2023-03-20 07:58:43] [INFO ] Invariant cache hit.
[2023-03-20 07:58:43] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-20 07:58:43] [INFO ] Invariant cache hit.
[2023-03-20 07:58:44] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-20 07:58:44] [INFO ] Invariant cache hit.
[2023-03-20 07:58:45] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2072 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 839 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 741 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 203 ms. (steps per millisecond=49 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:58:47] [INFO ] Invariant cache hit.
[2023-03-20 07:58:47] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-20 07:58:47] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:58:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-20 07:58:48] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:58:49] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 1 ms to minimize.
[2023-03-20 07:58:49] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 1 ms to minimize.
[2023-03-20 07:58:50] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 2 ms to minimize.
[2023-03-20 07:58:50] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 1 ms to minimize.
[2023-03-20 07:58:50] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 1 ms to minimize.
[2023-03-20 07:58:50] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 0 ms to minimize.
[2023-03-20 07:58:51] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 1 ms to minimize.
[2023-03-20 07:58:51] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-03-20 07:58:51] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2023-03-20 07:58:52] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 0 ms to minimize.
[2023-03-20 07:58:52] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:58:52] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 0 ms to minimize.
[2023-03-20 07:58:53] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 0 ms to minimize.
[2023-03-20 07:58:53] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 1 ms to minimize.
[2023-03-20 07:58:53] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 1 ms to minimize.
[2023-03-20 07:58:53] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 1 ms to minimize.
[2023-03-20 07:58:54] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 1 ms to minimize.
[2023-03-20 07:58:54] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 1 ms to minimize.
[2023-03-20 07:58:54] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2023-03-20 07:58:55] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:58:55] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 0 ms to minimize.
[2023-03-20 07:58:55] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 2 ms to minimize.
[2023-03-20 07:58:55] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 1 ms to minimize.
[2023-03-20 07:58:56] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2023-03-20 07:58:56] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2023-03-20 07:58:56] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2023-03-20 07:58:57] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 1 ms to minimize.
[2023-03-20 07:58:57] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 0 ms to minimize.
[2023-03-20 07:58:57] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-20 07:58:57] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2023-03-20 07:58:58] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 0 ms to minimize.
[2023-03-20 07:58:58] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2023-03-20 07:58:58] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2023-03-20 07:58:58] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2023-03-20 07:58:59] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 2 ms to minimize.
[2023-03-20 07:58:59] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2023-03-20 07:58:59] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 0 ms to minimize.
[2023-03-20 07:58:59] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 0 ms to minimize.
[2023-03-20 07:59:00] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 1 ms to minimize.
[2023-03-20 07:59:00] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 1 ms to minimize.
[2023-03-20 07:59:00] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 1 ms to minimize.
[2023-03-20 07:59:00] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 0 ms to minimize.
[2023-03-20 07:59:01] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2023-03-20 07:59:01] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 0 ms to minimize.
[2023-03-20 07:59:01] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 1 ms to minimize.
[2023-03-20 07:59:01] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 0 ms to minimize.
[2023-03-20 07:59:02] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 0 ms to minimize.
[2023-03-20 07:59:02] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 0 ms to minimize.
[2023-03-20 07:59:02] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 0 ms to minimize.
[2023-03-20 07:59:02] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 0 ms to minimize.
[2023-03-20 07:59:03] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 1 ms to minimize.
[2023-03-20 07:59:03] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 0 ms to minimize.
[2023-03-20 07:59:03] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 1 ms to minimize.
[2023-03-20 07:59:03] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 1 ms to minimize.
[2023-03-20 07:59:04] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 0 ms to minimize.
[2023-03-20 07:59:04] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 0 ms to minimize.
[2023-03-20 07:59:04] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2023-03-20 07:59:04] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 1 ms to minimize.
[2023-03-20 07:59:05] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 0 ms to minimize.
[2023-03-20 07:59:05] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 1 ms to minimize.
[2023-03-20 07:59:05] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2023-03-20 07:59:05] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2023-03-20 07:59:05] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 1 ms to minimize.
[2023-03-20 07:59:06] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 0 ms to minimize.
[2023-03-20 07:59:06] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 17509 ms
[2023-03-20 07:59:06] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-20 07:59:06] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 1 ms to minimize.
[2023-03-20 07:59:06] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 0 ms to minimize.
[2023-03-20 07:59:07] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 1 ms to minimize.
[2023-03-20 07:59:07] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2023-03-20 07:59:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1202 ms
[2023-03-20 07:59:07] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 1 ms to minimize.
[2023-03-20 07:59:07] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2023-03-20 07:59:08] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:59:08] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:59:08] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-20 07:59:08] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2023-03-20 07:59:09] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 1 ms to minimize.
[2023-03-20 07:59:09] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-20 07:59:09] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 0 ms to minimize.
[2023-03-20 07:59:09] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 1 ms to minimize.
[2023-03-20 07:59:10] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 1 ms to minimize.
[2023-03-20 07:59:10] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 1 ms to minimize.
[2023-03-20 07:59:10] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 0 ms to minimize.
[2023-03-20 07:59:10] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 0 ms to minimize.
[2023-03-20 07:59:11] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 0 ms to minimize.
[2023-03-20 07:59:11] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 0 ms to minimize.
[2023-03-20 07:59:11] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2023-03-20 07:59:11] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 1 ms to minimize.
[2023-03-20 07:59:12] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 2 ms to minimize.
[2023-03-20 07:59:12] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 1 ms to minimize.
[2023-03-20 07:59:12] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 0 ms to minimize.
[2023-03-20 07:59:12] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 1 ms to minimize.
[2023-03-20 07:59:13] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 07:59:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:59:13] [INFO ] After 25193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 99 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 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 76 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 77 ms. Remains : 425/992 places, 575/1142 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 240025 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 240025 steps, saw 95031 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 575 rows 425 cols
[2023-03-20 07:59:16] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 07:59:16] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:59:17] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:59:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:59:17] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:59:17] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-20 07:59:17] [INFO ] After 377ms 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-20 07:59:17] [INFO ] After 548ms 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 14 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 9 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 9 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 9 ms. Remains 425 /425 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-20 07:59:17] [INFO ] Invariant cache hit.
[2023-03-20 07:59:17] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-20 07:59:17] [INFO ] Invariant cache hit.
[2023-03-20 07:59:18] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-20 07:59:18] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 07:59:18] [INFO ] Invariant cache hit.
[2023-03-20 07:59:18] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 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.
Running SMT prover for 3 properties.
[2023-03-20 07:59:18] [INFO ] Invariant cache hit.
[2023-03-20 07:59:18] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 07:59:18] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:59:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 07:59:19] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-20 07:59:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2023-03-20 07:59:19] [INFO ] After 854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-20 07:59:20] [INFO ] After 1072ms 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 784 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 649 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 605 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-20 07:59:22] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 07:59:22] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-20 07:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:59:24] [INFO ] [Real]Absence check using state equation in 1847 ms returned sat
[2023-03-20 07:59:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:59:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 70 ms returned sat
[2023-03-20 07:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:59:26] [INFO ] [Nat]Absence check using state equation in 1902 ms returned sat
[2023-03-20 07:59:27] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 72 ms.
[2023-03-20 07:59:40] [INFO ] Deduced a trap composed of 14 places in 454 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: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-20 07:59:40] [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-20 07:59:40] [INFO ] Invariant cache hit.
[2023-03-20 07:59:40] [INFO ] [Real]Absence check using 121 positive place invariants in 63 ms returned sat
[2023-03-20 07:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:59:42] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2023-03-20 07:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:59:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 82 ms returned sat
[2023-03-20 07:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:59:44] [INFO ] [Nat]Absence check using state equation in 1975 ms returned sat
[2023-03-20 07:59:45] [INFO ] Computed and/alt/rep : 1141/3614/1141 causal constraints (skipped 0 transitions) in 58 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: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-20 07:59:57] [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 p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 693 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 20005 reset in 385 ms.
Product exploration explored 100000 steps with 20008 reset in 367 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 566 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 15 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 14 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 0 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 0 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 188 ms. Remains 782 /992 variables (removed 210) and now considering 961/1142 (removed 181) transitions.
[2023-03-20 08:00:04] [INFO ] Redundant transitions in 4659 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-20 08:00:04] [INFO ] Computed 121 place invariants in 11 ms
[2023-03-20 08:00:13] [INFO ] Dead Transitions using invariants and state equation in 8570 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 1 ms
Applied a total of 0 rules in 22 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 13466 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 17 ms. Remains 992 /992 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
// Phase 1: matrix 1142 rows 992 cols
[2023-03-20 08:00:13] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 08:00:13] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-20 08:00:13] [INFO ] Invariant cache hit.
[2023-03-20 08:00:14] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-03-20 08:00:14] [INFO ] Invariant cache hit.
[2023-03-20 08:00:15] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1930 ms. Remains : 992/992 places, 1142/1142 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-14 finished in 170068 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 77 ms. Remains 424 /999 variables (removed 575) and now considering 574/1149 (removed 575) transitions.
// Phase 1: matrix 574 rows 424 cols
[2023-03-20 08:00:15] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:00:15] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-20 08:00:15] [INFO ] Invariant cache hit.
[2023-03-20 08:00:15] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-20 08:00:15] [INFO ] Redundant transitions in 113 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-20 08:00:15] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:00:16] [INFO ] Dead Transitions using invariants and state equation in 235 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 10 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 1061 ms. Remains : 424/999 places, 573/1149 transitions.
Stuttering acceptance computed with spot in 62 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 264 reset in 418 ms.
Product exploration explored 100000 steps with 261 reset in 482 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 259 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 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Finished Best-First random walk after 1154 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=288 )
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 477 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 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 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 11 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 08:00:18] [INFO ] Invariant cache hit.
[2023-03-20 08:00:18] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-20 08:00:18] [INFO ] Invariant cache hit.
[2023-03-20 08:00:19] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-20 08:00:19] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-20 08:00:19] [INFO ] Invariant cache hit.
[2023-03-20 08:00:19] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1207 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 268 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 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :1
Finished Best-First random walk after 964 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=241 )
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 346 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 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 262 reset in 488 ms.
Product exploration explored 100000 steps with 261 reset in 611 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 10 ms. Remains 424 /424 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 08:00:21] [INFO ] Invariant cache hit.
[2023-03-20 08:00:22] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-20 08:00:22] [INFO ] Invariant cache hit.
[2023-03-20 08:00:22] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-20 08:00:22] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-20 08:00:22] [INFO ] Invariant cache hit.
[2023-03-20 08:00:23] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1190 ms. Remains : 424/424 places, 573/573 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-15 finished in 7995 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 155 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 1 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 118 ms. Remains 426 /999 variables (removed 573) and now considering 576/1149 (removed 573) transitions.
// Phase 1: matrix 576 rows 426 cols
[2023-03-20 08:00:23] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:00:23] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-20 08:00:23] [INFO ] Invariant cache hit.
[2023-03-20 08:00:24] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-20 08:00:24] [INFO ] Invariant cache hit.
[2023-03-20 08:00:24] [INFO ] Dead Transitions using invariants and state equation in 254 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 1109 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 245 reset in 407 ms.
Product exploration explored 100000 steps with 243 reset in 514 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 673 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 144 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:00:26] [INFO ] Invariant cache hit.
[2023-03-20 08:00:26] [INFO ] [Real]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 08:00:26] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-20 08:00:27] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:27] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:00:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-20 08:00:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-20 08:00:27] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 08:00:27] [INFO ] After 567ms 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 42 ms. Remains : 424/426 places, 574/576 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 435786 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435786 steps, saw 311823 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-20 08:00:30] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 08:00:30] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2023-03-20 08:00:30] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 08:00:31] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:31] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:00:31] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-20 08:00:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-20 08:00:31] [INFO ] After 451ms 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-20 08:00:31] [INFO ] After 579ms 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 11 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 12 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-20 08:00:31] [INFO ] Invariant cache hit.
[2023-03-20 08:00:31] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-20 08:00:31] [INFO ] Invariant cache hit.
[2023-03-20 08:00:32] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2023-03-20 08:00:32] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 08:00:32] [INFO ] Invariant cache hit.
[2023-03-20 08:00:32] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1352 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-20 08:00:32] [INFO ] Invariant cache hit.
[2023-03-20 08:00:32] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-20 08:00:33] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-20 08:00:33] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:33] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-20 08:00:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-20 08:00:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-20 08:00:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-20 08:00:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-20 08:00:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2023-03-20 08:00:33] [INFO ] After 616ms 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-20 08:00:33] [INFO ] After 793ms 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 547 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 179 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-20 08:00:34] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 08:00:35] [INFO ] [Real]Absence check using 121 positive place invariants in 65 ms returned sat
[2023-03-20 08:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:36] [INFO ] [Real]Absence check using state equation in 999 ms returned sat
[2023-03-20 08:00:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:00:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 08:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:37] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-20 08:00:37] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 34 ms.
[2023-03-20 08:00:43] [INFO ] Added : 475 causal constraints over 95 iterations in 5846 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 23 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-20 08:00:43] [INFO ] Invariant cache hit.
[2023-03-20 08:00:43] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-20 08:00:43] [INFO ] Invariant cache hit.
[2023-03-20 08:00:43] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-20 08:00:43] [INFO ] Invariant cache hit.
[2023-03-20 08:00:44] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1350 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 406 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 161 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:00:45] [INFO ] Invariant cache hit.
[2023-03-20 08:00:45] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-20 08:00:45] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2023-03-20 08:00:45] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:45] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2023-03-20 08:00:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2023-03-20 08:00:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-20 08:00:45] [INFO ] After 355ms 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-20 08:00:45] [INFO ] After 501ms 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 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 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 45 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 46 ms. Remains : 424/426 places, 574/576 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
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473282 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473282 steps, saw 319290 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 574 rows 424 cols
[2023-03-20 08:00:49] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 08:00:49] [INFO ] [Real]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-20 08:00:49] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-20 08:00:49] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:49] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-20 08:00:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-20 08:00:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-20 08:00:49] [INFO ] After 303ms 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-20 08:00:49] [INFO ] After 415ms 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 11 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 11 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 11 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-20 08:00:49] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-20 08:00:50] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2023-03-20 08:00:50] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 08:00:50] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1038 ms. Remains : 424/424 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 08:00:50] [INFO ] Invariant cache hit.
[2023-03-20 08:00:50] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 08:00:51] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:00:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 08:00:51] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:00:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-20 08:00:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-20 08:00:51] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-20 08:00:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-20 08:00:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2023-03-20 08:00:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 277 ms
[2023-03-20 08:00:51] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-20 08:00:51] [INFO ] After 641ms 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 440 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 180 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 576 rows 426 cols
[2023-03-20 08:00:52] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 08:00:52] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-20 08:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:53] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2023-03-20 08:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:00:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-20 08:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:00:53] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-20 08:00:53] [INFO ] Computed and/alt/rep : 503/2157/503 causal constraints (skipped 69 transitions) in 33 ms.
[2023-03-20 08:00:59] [INFO ] Added : 475 causal constraints over 95 iterations in 5737 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 244 reset in 530 ms.
Product exploration explored 100000 steps with 244 reset in 585 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 186 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 19 ms. Remains 426 /426 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-20 08:01:01] [INFO ] Redundant transitions in 184 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-20 08:01:01] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:01:01] [INFO ] Dead Transitions using invariants and state equation in 285 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 510 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-20 08:01:01] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:01:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-20 08:01:01] [INFO ] Invariant cache hit.
[2023-03-20 08:01:02] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-20 08:01:02] [INFO ] Invariant cache hit.
[2023-03-20 08:01:02] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 426/426 places, 576/576 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-04 finished in 39487 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 80 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 2 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 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 1 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 111 ms. Remains 423 /999 variables (removed 576) and now considering 573/1149 (removed 576) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-20 08:01:02] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:01:03] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:03] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-20 08:01:03] [INFO ] Invariant cache hit.
[2023-03-20 08:01:03] [INFO ] Dead Transitions using invariants and state equation in 223 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 891 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 27217 reset in 443 ms.
Product exploration explored 100000 steps with 27100 reset in 479 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 192 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 30 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 179 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-20 08:01:05] [INFO ] Invariant cache hit.
[2023-03-20 08:01:05] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 08:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:01:05] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-20 08:01:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:01:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 08:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:01:06] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-20 08:01:06] [INFO ] Computed and/alt/rep : 505/2162/505 causal constraints (skipped 66 transitions) in 31 ms.
[2023-03-20 08:01:11] [INFO ] Added : 499 causal constraints over 100 iterations in 5460 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 21 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2023-03-20 08:01:11] [INFO ] Invariant cache hit.
[2023-03-20 08:01:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-20 08:01:12] [INFO ] Invariant cache hit.
[2023-03-20 08:01:12] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-20 08:01:12] [INFO ] Redundant transitions in 109 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-20 08:01:12] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 08:01:12] [INFO ] Dead Transitions using invariants and state equation in 281 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 1051 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 138 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 27 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 117 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)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-20 08:01:13] [INFO ] Invariant cache hit.
[2023-03-20 08:01:13] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-20 08:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:01:13] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-20 08:01:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:01:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-20 08:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:01:14] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-20 08:01:14] [INFO ] Computed and/alt/rep : 505/2163/505 causal constraints (skipped 65 transitions) in 35 ms.
[2023-03-20 08:01:21] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-03-20 08:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-20 08:01:21] [INFO ] Added : 498 causal constraints over 100 iterations in 7142 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27124 reset in 571 ms.
Product exploration explored 100000 steps with 27106 reset in 566 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-20 08:01:23] [INFO ] Invariant cache hit.
[2023-03-20 08:01:23] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-20 08:01:23] [INFO ] Invariant cache hit.
[2023-03-20 08:01:23] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2023-03-20 08:01:23] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-20 08:01:23] [INFO ] Invariant cache hit.
[2023-03-20 08:01:24] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 423/423 places, 572/572 transitions.
Treatment of property ShieldRVs-PT-030B-LTLFireability-07 finished in 21578 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-20 08:01:24] [INFO ] Flatten gal took : 90 ms
[2023-03-20 08:01:24] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 08:01:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 999 places, 1149 transitions and 3912 arcs took 10 ms.
Total runtime 391851 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4394/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-04
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-05
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-07
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-13
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-14
Could not compute solution for formula : ShieldRVs-PT-030B-LTLFireability-15

BK_STOP 1679299288407

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-030B-LTLFireability-05
ltl formula formula --ltl=/tmp/4394/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 999 places, 1149 transitions and 3912 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4394/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4394/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4394/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.030 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4394/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55961d1463f4]
1: pnml2lts-mc(+0xa2496) [0x55961d146496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fdcbf35f140]
3: pnml2lts-mc(+0x405be5) [0x55961d4a9be5]
4: pnml2lts-mc(+0x16b3f9) [0x55961d20f3f9]
5: pnml2lts-mc(+0x164ac4) [0x55961d208ac4]
6: pnml2lts-mc(+0x272e0a) [0x55961d316e0a]
7: pnml2lts-mc(+0xb61f0) [0x55961d15a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fdcbf1b24d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fdcbf1b267a]
10: pnml2lts-mc(+0xa1581) [0x55961d145581]
11: pnml2lts-mc(+0xa1910) [0x55961d145910]
12: pnml2lts-mc(+0xa32a2) [0x55961d1472a2]
13: pnml2lts-mc(+0xa50f4) [0x55961d1490f4]
14: pnml2lts-mc(+0xa516b) [0x55961d14916b]
15: pnml2lts-mc(+0x3f34b3) [0x55961d4974b3]
16: pnml2lts-mc(+0x7c63d) [0x55961d12063d]
17: pnml2lts-mc(+0x67d86) [0x55961d10bd86]
18: pnml2lts-mc(+0x60a8a) [0x55961d104a8a]
19: pnml2lts-mc(+0x5eb15) [0x55961d102b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fdcbf19ad0a]
21: pnml2lts-mc(+0x6075e) [0x55961d10475e]
ltl formula name ShieldRVs-PT-030B-LTLFireability-13
ltl formula formula --ltl=/tmp/4394/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 999 places, 1149 transitions and 3912 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4394/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4394/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4394/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4394/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-030B-LTLFireability-14
ltl formula formula --ltl=/tmp/4394/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 999 places, 1149 transitions and 3912 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.060 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4394/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4394/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4394/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4394/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 20 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-030B-LTLFireability-15
ltl formula formula --ltl=/tmp/4394/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 999 places, 1149 transitions and 3912 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.050 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4394/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4394/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4394/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4394/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r425-tajo-167905977800124"
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 ;