Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903714900092.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:40 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.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 164K 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 ShieldIIPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679265711005

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:41:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:41:54] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-19 22:41:54] [INFO ] Transformed 603 places.
[2023-03-19 22:41:54] [INFO ] Transformed 593 transitions.
[2023-03-19 22:41:54] [INFO ] Found NUPN structural information;
[2023-03-19 22:41:54] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 539 transition count 529
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 539 transition count 529
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 538 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 538 transition count 528
Applied a total of 130 rules in 149 ms. Remains 538 /603 variables (removed 65) and now considering 528/593 (removed 65) transitions.
// Phase 1: matrix 528 rows 538 cols
[2023-03-19 22:41:54] [INFO ] Computed 91 place invariants in 32 ms
[2023-03-19 22:41:55] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-19 22:41:55] [INFO ] Invariant cache hit.
[2023-03-19 22:41:56] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-03-19 22:41:56] [INFO ] Invariant cache hit.
[2023-03-19 22:41:56] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/603 places, 528/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2673 ms. Remains : 538/603 places, 528/593 transitions.
Support contains 43 out of 538 places after structural reductions.
[2023-03-19 22:41:57] [INFO ] Flatten gal took : 103 ms
[2023-03-19 22:41:57] [INFO ] Flatten gal took : 46 ms
[2023-03-19 22:41:57] [INFO ] Input system was already deterministic with 528 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 26) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 22:41:57] [INFO ] Invariant cache hit.
[2023-03-19 22:41:58] [INFO ] [Real]Absence check using 91 positive place invariants in 31 ms returned sat
[2023-03-19 22:41:59] [INFO ] After 1291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:41:59] [INFO ] [Nat]Absence check using 91 positive place invariants in 127 ms returned sat
[2023-03-19 22:41:59] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:41:59] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 10 ms to minimize.
[2023-03-19 22:42:00] [INFO ] Deduced a trap composed of 17 places in 1066 ms of which 1 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 4 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 15 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-19 22:42:01] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2023-03-19 22:42:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2971 ms
[2023-03-19 22:42:02] [INFO ] After 3203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-19 22:42:02] [INFO ] After 3458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 528/528 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 538 transition count 477
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 487 transition count 477
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 487 transition count 426
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 436 transition count 426
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 431 transition count 421
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 431 transition count 421
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 214 place count 431 transition count 418
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 428 transition count 418
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 572 place count 252 transition count 242
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 640 place count 252 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 251 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 250 transition count 241
Applied a total of 642 rules in 100 ms. Remains 250 /538 variables (removed 288) and now considering 241/528 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 250/538 places, 241/528 transitions.
Finished random walk after 756 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=151 )
Computed a total of 122 stabilizing places and 122 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((p0 U (G(p0)||(p0&&G(!p1))))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 24 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-19 22:42:03] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-19 22:42:03] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-19 22:42:03] [INFO ] Invariant cache hit.
[2023-03-19 22:42:04] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2023-03-19 22:42:04] [INFO ] Invariant cache hit.
[2023-03-19 22:42:05] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1985 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 427 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s222 1), p1:(AND (EQ s180 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-01 finished in 2568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||X(p2))))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 49 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-19 22:42:05] [INFO ] Computed 91 place invariants in 15 ms
[2023-03-19 22:42:07] [INFO ] Implicit Places using invariants in 1314 ms returned []
[2023-03-19 22:42:07] [INFO ] Invariant cache hit.
[2023-03-19 22:42:08] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
[2023-03-19 22:42:08] [INFO ] Invariant cache hit.
[2023-03-19 22:42:09] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3293 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s57 1), p1:(AND (EQ s342 1) (EQ s366 1)), p2:(AND (EQ s399 1) (EQ s467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-03 finished in 3655 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))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 537 transition count 476
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 486 transition count 476
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 486 transition count 425
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 435 transition count 425
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 429 transition count 419
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 429 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 216 place count 429 transition count 416
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 426 transition count 416
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 566 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 251 transition count 242
Applied a total of 569 rules in 112 ms. Remains 251 /538 variables (removed 287) and now considering 242/528 (removed 286) transitions.
// Phase 1: matrix 242 rows 251 cols
[2023-03-19 22:42:09] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-19 22:42:09] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-19 22:42:09] [INFO ] Invariant cache hit.
[2023-03-19 22:42:10] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-19 22:42:10] [INFO ] Redundant transitions in 191 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 241 rows 251 cols
[2023-03-19 22:42:10] [INFO ] Computed 90 place invariants in 28 ms
[2023-03-19 22:42:10] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/538 places, 241/528 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1106 ms. Remains : 251/538 places, 241/528 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27321 reset in 497 ms.
Product exploration explored 100000 steps with 27469 reset in 417 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/251 stabilizing places and 2/241 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 245 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 72 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 340 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-19 22:42:12] [INFO ] Invariant cache hit.
[2023-03-19 22:42:12] [INFO ] [Real]Absence check using 90 positive place invariants in 101 ms returned sat
[2023-03-19 22:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:12] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-19 22:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:42:13] [INFO ] [Nat]Absence check using 90 positive place invariants in 24 ms returned sat
[2023-03-19 22:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:13] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-19 22:42:13] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 14 ms to minimize.
[2023-03-19 22:42:13] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-19 22:42:13] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 16 ms to minimize.
[2023-03-19 22:42:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 537 ms
[2023-03-19 22:42:13] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 29 ms.
[2023-03-19 22:42:15] [INFO ] Added : 162 causal constraints over 33 iterations in 1724 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 14 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-19 22:42:15] [INFO ] Invariant cache hit.
[2023-03-19 22:42:15] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-19 22:42:15] [INFO ] Invariant cache hit.
[2023-03-19 22:42:16] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-19 22:42:16] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-19 22:42:16] [INFO ] Invariant cache hit.
[2023-03-19 22:42:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 251/251 places, 241/241 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/251 stabilizing places and 2/241 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 242 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 46 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 314 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
[2023-03-19 22:42:17] [INFO ] Invariant cache hit.
[2023-03-19 22:42:17] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-19 22:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:17] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2023-03-19 22:42:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:42:17] [INFO ] [Nat]Absence check using 90 positive place invariants in 71 ms returned sat
[2023-03-19 22:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:18] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-19 22:42:18] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-19 22:42:18] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-19 22:42:18] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 8 ms to minimize.
[2023-03-19 22:42:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-03-19 22:42:18] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 25 ms.
[2023-03-19 22:42:19] [INFO ] Added : 162 causal constraints over 33 iterations in 1149 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27174 reset in 359 ms.
Product exploration explored 100000 steps with 27449 reset in 415 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 13 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-19 22:42:20] [INFO ] Invariant cache hit.
[2023-03-19 22:42:20] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-19 22:42:20] [INFO ] Invariant cache hit.
[2023-03-19 22:42:21] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-19 22:42:21] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-19 22:42:21] [INFO ] Invariant cache hit.
[2023-03-19 22:42:21] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1125 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-04 finished in 12029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X(p2))))))'
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 16 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-19 22:42:21] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-19 22:42:21] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-19 22:42:21] [INFO ] Invariant cache hit.
[2023-03-19 22:42:23] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-03-19 22:42:23] [INFO ] Invariant cache hit.
[2023-03-19 22:42:23] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1803 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s260 1), p1:(OR (EQ s478 1) (AND (EQ s497 1) (EQ s499 1))), p2:(AND (EQ s497 1) (EQ s499 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 248 reset in 427 ms.
Stuttering criterion allowed to conclude after 46908 steps with 120 reset in 156 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-05 finished in 2769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 35 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-19 22:42:24] [INFO ] Computed 91 place invariants in 19 ms
[2023-03-19 22:42:24] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-19 22:42:24] [INFO ] Invariant cache hit.
[2023-03-19 22:42:25] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2023-03-19 22:42:25] [INFO ] Invariant cache hit.
[2023-03-19 22:42:26] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1702 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s227 1), p1:(OR (EQ s468 1) (EQ s531 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 3401 reset in 236 ms.
Product exploration explored 100000 steps with 3408 reset in 289 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 308 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-19 22:42:27] [INFO ] Invariant cache hit.
[2023-03-19 22:42:27] [INFO ] [Real]Absence check using 91 positive place invariants in 30 ms returned sat
[2023-03-19 22:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:28] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2023-03-19 22:42:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:42:28] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2023-03-19 22:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:42:30] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2023-03-19 22:42:30] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 1 ms to minimize.
[2023-03-19 22:42:30] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-03-19 22:42:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 678 ms
[2023-03-19 22:42:30] [INFO ] Computed and/alt/rep : 521/1172/521 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-19 22:42:38] [INFO ] Added : 445 causal constraints over 89 iterations in 7343 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 531 transition count 471
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 481 transition count 471
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 481 transition count 421
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 431 transition count 421
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 253 transition count 244
Applied a total of 553 rules in 30 ms. Remains 253 /532 variables (removed 279) and now considering 244/522 (removed 278) transitions.
// Phase 1: matrix 244 rows 253 cols
[2023-03-19 22:42:38] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:42:38] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-19 22:42:38] [INFO ] Invariant cache hit.
[2023-03-19 22:42:38] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-19 22:42:38] [INFO ] Redundant transitions in 46 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 243 rows 253 cols
[2023-03-19 22:42:38] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:42:38] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/532 places, 243/522 transitions.
Applied a total of 0 rules in 10 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 816 ms. Remains : 253/532 places, 243/522 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/253 stabilizing places and 2/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-06 finished in 14753 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(F(p1))||p0))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 23 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-19 22:42:39] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-19 22:42:39] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-19 22:42:39] [INFO ] Invariant cache hit.
[2023-03-19 22:42:39] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-19 22:42:39] [INFO ] Invariant cache hit.
[2023-03-19 22:42:40] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s60 0) (AND (EQ s453 1) (EQ s471 1) (EQ s478 1))), p1:(EQ s524 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 469 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/533 stabilizing places and 119/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-08 finished in 2307 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(X(X(F(p0)))))))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 24 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-19 22:42:41] [INFO ] Computed 91 place invariants in 5 ms
[2023-03-19 22:42:41] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 22:42:41] [INFO ] Invariant cache hit.
[2023-03-19 22:42:42] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-19 22:42:42] [INFO ] Invariant cache hit.
[2023-03-19 22:42:42] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s483 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1449 steps with 1 reset in 12 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-09 finished in 1352 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(G(!p0)))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 42 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
[2023-03-19 22:42:42] [INFO ] Invariant cache hit.
[2023-03-19 22:42:43] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-19 22:42:43] [INFO ] Invariant cache hit.
[2023-03-19 22:42:45] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2023-03-19 22:42:45] [INFO ] Invariant cache hit.
[2023-03-19 22:42:46] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3746 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s81 1) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 740 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-10 finished in 3942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 51 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
[2023-03-19 22:42:46] [INFO ] Invariant cache hit.
[2023-03-19 22:42:47] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 22:42:47] [INFO ] Invariant cache hit.
[2023-03-19 22:42:47] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2023-03-19 22:42:47] [INFO ] Invariant cache hit.
[2023-03-19 22:42:48] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1295 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s52 0) (EQ s63 0)), p2:(AND (EQ s39 1) (EQ s83 1)), p1:(AND (EQ s237 1) (EQ s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33329 reset in 353 ms.
Product exploration explored 100000 steps with 33210 reset in 314 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1249 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 22:42:50] [INFO ] Invariant cache hit.
[2023-03-19 22:42:51] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:42:51] [INFO ] [Nat]Absence check using 91 positive place invariants in 30 ms returned sat
[2023-03-19 22:42:51] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:42:51] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 2 ms to minimize.
[2023-03-19 22:42:52] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 1 ms to minimize.
[2023-03-19 22:42:52] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2023-03-19 22:42:52] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 0 ms to minimize.
[2023-03-19 22:42:52] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 0 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-19 22:42:53] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 13 ms to minimize.
[2023-03-19 22:42:54] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-19 22:42:54] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-03-19 22:42:54] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2023-03-19 22:42:54] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 0 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 13 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 26 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-19 22:42:55] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-19 22:42:56] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-19 22:42:56] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-19 22:42:56] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2023-03-19 22:42:56] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2023-03-19 22:42:56] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2023-03-19 22:42:57] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 14 ms to minimize.
[2023-03-19 22:42:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2023-03-19 22:42:57] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-19 22:42:57] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5755 ms
[2023-03-19 22:42:57] [INFO ] After 6158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-19 22:42:57] [INFO ] After 6505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 432 transition count 422
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 44 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 255/532 places, 246/522 transitions.
Finished random walk after 6033 steps, including 6 resets, run visited all 2 properties in 53 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1542 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2023-03-19 22:43:00] [INFO ] Invariant cache hit.
[2023-03-19 22:43:00] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-19 22:43:00] [INFO ] Invariant cache hit.
[2023-03-19 22:43:00] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-19 22:43:00] [INFO ] Invariant cache hit.
[2023-03-19 22:43:01] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1407 ms. Remains : 532/532 places, 522/522 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1105 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 22:43:03] [INFO ] Invariant cache hit.
[2023-03-19 22:43:03] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:43:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2023-03-19 22:43:03] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:43:03] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 0 ms to minimize.
[2023-03-19 22:43:04] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2023-03-19 22:43:04] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-19 22:43:04] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-19 22:43:04] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 0 ms to minimize.
[2023-03-19 22:43:04] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-19 22:43:05] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-19 22:43:05] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2023-03-19 22:43:05] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2023-03-19 22:43:05] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2023-03-19 22:43:05] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2023-03-19 22:43:06] [INFO ] Deduced a trap composed of 24 places in 425 ms of which 1 ms to minimize.
[2023-03-19 22:43:06] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-19 22:43:06] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
[2023-03-19 22:43:06] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 19 ms to minimize.
[2023-03-19 22:43:06] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 1 ms to minimize.
[2023-03-19 22:43:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3307 ms
[2023-03-19 22:43:07] [INFO ] After 3728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-19 22:43:07] [INFO ] After 4049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 200 place count 432 transition count 422
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 68 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 255/532 places, 246/522 transitions.
Finished random walk after 3089 steps, including 3 resets, run visited all 2 properties in 21 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1387 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33423 reset in 360 ms.
Product exploration explored 100000 steps with 33340 reset in 348 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 532 transition count 522
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 48 place count 532 transition count 524
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 532 transition count 524
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 275 place count 532 transition count 524
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 342 place count 465 transition count 457
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 409 place count 465 transition count 457
Deduced a syphon composed of 208 places in 0 ms
Applied a total of 409 rules in 112 ms. Remains 465 /532 variables (removed 67) and now considering 457/522 (removed 65) transitions.
[2023-03-19 22:43:11] [INFO ] Redundant transitions in 112 ms returned [456]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 456 rows 465 cols
[2023-03-19 22:43:11] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-19 22:43:12] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/532 places, 456/522 transitions.
Deduced a syphon composed of 208 places in 0 ms
Applied a total of 0 rules in 11 ms. Remains 465 /465 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 942 ms. Remains : 465/532 places, 456/522 transitions.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 11 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-19 22:43:12] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-19 22:43:12] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-19 22:43:12] [INFO ] Invariant cache hit.
[2023-03-19 22:43:13] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-19 22:43:13] [INFO ] Invariant cache hit.
[2023-03-19 22:43:13] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1084 ms. Remains : 532/532 places, 522/522 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 26847 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((F(p1)||p0))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 537 transition count 478
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 488 transition count 478
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 98 place count 488 transition count 426
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 202 place count 436 transition count 426
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 430 transition count 420
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 214 place count 430 transition count 417
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 427 transition count 417
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 566 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 251 transition count 242
Applied a total of 569 rules in 52 ms. Remains 251 /538 variables (removed 287) and now considering 242/528 (removed 286) transitions.
// Phase 1: matrix 242 rows 251 cols
[2023-03-19 22:43:13] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:43:13] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-19 22:43:13] [INFO ] Invariant cache hit.
[2023-03-19 22:43:14] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-19 22:43:14] [INFO ] Redundant transitions in 35 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 241 rows 251 cols
[2023-03-19 22:43:14] [INFO ] Computed 90 place invariants in 0 ms
[2023-03-19 22:43:14] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/538 places, 241/528 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 845 ms. Remains : 251/538 places, 241/528 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-13 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:(OR (NEQ s180 1) (NEQ s194 1)), p1:(OR (NEQ s211 1) (NEQ s218 1) (NEQ s228 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 197 reset in 388 ms.
Product exploration explored 100000 steps with 196 reset in 399 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 302 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 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 930 steps, including 1 resets, run visited all 2 properties in 22 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 426 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 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 22 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-19 22:43:16] [INFO ] Invariant cache hit.
[2023-03-19 22:43:16] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-19 22:43:16] [INFO ] Invariant cache hit.
[2023-03-19 22:43:17] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-19 22:43:17] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 22:43:17] [INFO ] Invariant cache hit.
[2023-03-19 22:43:17] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 892 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 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 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7113 steps, including 13 resets, run visited all 2 properties in 59 ms. (steps per millisecond=120 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 321 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 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 196 reset in 413 ms.
Product exploration explored 100000 steps with 194 reset in 393 ms.
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 16 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-19 22:43:19] [INFO ] Invariant cache hit.
[2023-03-19 22:43:19] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-19 22:43:19] [INFO ] Invariant cache hit.
[2023-03-19 22:43:19] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-19 22:43:19] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-19 22:43:19] [INFO ] Invariant cache hit.
[2023-03-19 22:43:20] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 810 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-13 finished in 6570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 537 transition count 476
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 486 transition count 476
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 486 transition count 425
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 435 transition count 425
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 430 transition count 420
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 214 place count 430 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 428 transition count 418
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 562 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 564 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 565 place count 253 transition count 244
Applied a total of 565 rules in 32 ms. Remains 253 /538 variables (removed 285) and now considering 244/528 (removed 284) transitions.
// Phase 1: matrix 244 rows 253 cols
[2023-03-19 22:43:20] [INFO ] Computed 90 place invariants in 0 ms
[2023-03-19 22:43:20] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-19 22:43:20] [INFO ] Invariant cache hit.
[2023-03-19 22:43:20] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-19 22:43:20] [INFO ] Redundant transitions in 90 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 243 rows 253 cols
[2023-03-19 22:43:20] [INFO ] Computed 90 place invariants in 0 ms
[2023-03-19 22:43:20] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/538 places, 243/528 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 817 ms. Remains : 253/538 places, 243/528 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s180 1) (EQ s191 1)) (EQ s44 1)), p1:(EQ s44 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 529 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-14 finished in 884 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)&&F(p1))) U (p2&&X(p3))))'
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 534 transition count 524
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 534 transition count 524
Applied a total of 8 rules in 26 ms. Remains 534 /538 variables (removed 4) and now considering 524/528 (removed 4) transitions.
// Phase 1: matrix 524 rows 534 cols
[2023-03-19 22:43:21] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-19 22:43:21] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-19 22:43:21] [INFO ] Invariant cache hit.
[2023-03-19 22:43:21] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2023-03-19 22:43:21] [INFO ] Invariant cache hit.
[2023-03-19 22:43:22] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/538 places, 524/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1171 ms. Remains : 534/538 places, 524/528 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s15 1), p0:(NEQ s64 1), p1:(AND (EQ s466 1) (EQ s15 1)), p3:(EQ s374 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1335 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-15 finished in 1600 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010B-LTLFireability-11
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 537 transition count 477
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 487 transition count 477
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 100 place count 487 transition count 426
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 202 place count 436 transition count 426
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 430 transition count 420
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 214 place count 430 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 428 transition count 418
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 558 place count 258 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 560 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 255 transition count 246
Applied a total of 561 rules in 55 ms. Remains 255 /538 variables (removed 283) and now considering 246/528 (removed 282) transitions.
// Phase 1: matrix 246 rows 255 cols
[2023-03-19 22:43:23] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:43:23] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-19 22:43:23] [INFO ] Invariant cache hit.
[2023-03-19 22:43:23] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-19 22:43:23] [INFO ] Invariant cache hit.
[2023-03-19 22:43:24] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 255/538 places, 246/528 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 839 ms. Remains : 255/538 places, 246/528 transitions.
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s22 0) (EQ s28 0)), p2:(AND (EQ s14 1) (EQ s37 1)), p1:(AND (EQ s112 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33307 reset in 357 ms.
Product exploration explored 100000 steps with 33358 reset in 467 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 967 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 22:43:26] [INFO ] Invariant cache hit.
[2023-03-19 22:43:26] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:43:26] [INFO ] [Nat]Absence check using 90 positive place invariants in 32 ms returned sat
[2023-03-19 22:43:26] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:43:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-19 22:43:26] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-19 22:43:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-19 22:43:26] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-19 22:43:26] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 255 transition count 246
Applied a total of 56 rules in 17 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 255/255 places, 246/246 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 797445 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 797445 steps, saw 255207 distinct states, run finished after 3002 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 255 cols
[2023-03-19 22:43:30] [INFO ] Computed 90 place invariants in 19 ms
[2023-03-19 22:43:30] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:43:30] [INFO ] [Nat]Absence check using 90 positive place invariants in 24 ms returned sat
[2023-03-19 22:43:30] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:43:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-19 22:43:30] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-19 22:43:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-19 22:43:30] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 22:43:30] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 255/255 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-19 22:43:30] [INFO ] Invariant cache hit.
[2023-03-19 22:43:31] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-19 22:43:31] [INFO ] Invariant cache hit.
[2023-03-19 22:43:31] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-19 22:43:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 22:43:31] [INFO ] Invariant cache hit.
[2023-03-19 22:43:31] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1249 ms. Remains : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 22:43:31] [INFO ] Invariant cache hit.
[2023-03-19 22:43:32] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:43:32] [INFO ] [Nat]Absence check using 90 positive place invariants in 15 ms returned sat
[2023-03-19 22:43:32] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:43:32] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-19 22:43:32] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-19 22:43:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-19 22:43:32] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-19 22:43:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 447 ms
[2023-03-19 22:43:32] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 22:43:32] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1247 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 255 cols
[2023-03-19 22:43:34] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:43:34] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-19 22:43:34] [INFO ] Invariant cache hit.
[2023-03-19 22:43:35] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-19 22:43:35] [INFO ] Invariant cache hit.
[2023-03-19 22:43:35] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 804 ms. Remains : 255/255 places, 246/246 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 954 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :7
Finished Best-First random walk after 9846 steps, including 2 resets, run visited all 1 properties in 40 ms. (steps per millisecond=246 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1894 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33355 reset in 355 ms.
Product exploration explored 100000 steps with 33335 reset in 388 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-19 22:43:41] [INFO ] Redundant transitions in 77 ms returned [245]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 245 rows 255 cols
[2023-03-19 22:43:41] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-19 22:43:41] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 245/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 255/255 places, 245/246 transitions.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 255 cols
[2023-03-19 22:43:41] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-19 22:43:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 22:43:41] [INFO ] Invariant cache hit.
[2023-03-19 22:43:41] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-19 22:43:41] [INFO ] Invariant cache hit.
[2023-03-19 22:43:41] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 255/255 places, 246/246 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 19330 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((F(p1)||p0))))'
[2023-03-19 22:43:42] [INFO ] Flatten gal took : 23 ms
[2023-03-19 22:43:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 22:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 528 transitions and 1656 arcs took 6 ms.
Total runtime 108401 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-010B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA ShieldIIPs-PT-010B-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679265892805

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 9 (type EXCL) for 0 ShieldIIPs-PT-010B-LTLFireability-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-04: F 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 EG EXCL 5/1200 6/32 ShieldIIPs-PT-010B-LTLFireability-04 1669166 m, 333833 m/sec, 2928097 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 9 (type EXCL) for ShieldIIPs-PT-010B-LTLFireability-04
lola: result : false
lola: markings : 2429240
lola: fired transitions : 4255669
lola: time used : 8.000000
lola: memory pages used : 9
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-010B-LTLFireability-11
lola: time limit : 1796 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 2/1796 4/32 ShieldIIPs-PT-010B-LTLFireability-11 270765 m, 54153 m/sec, 894159 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 7/1796 9/32 ShieldIIPs-PT-010B-LTLFireability-11 722737 m, 90394 m/sec, 2630625 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 12/1796 13/32 ShieldIIPs-PT-010B-LTLFireability-11 1143711 m, 84194 m/sec, 4353501 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 17/1796 18/32 ShieldIIPs-PT-010B-LTLFireability-11 1572543 m, 85766 m/sec, 6069535 t fired, .

Time elapsed: 25 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 22/1796 22/32 ShieldIIPs-PT-010B-LTLFireability-11 1953529 m, 76197 m/sec, 7765341 t fired, .

Time elapsed: 30 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 27/1796 26/32 ShieldIIPs-PT-010B-LTLFireability-11 2328557 m, 75005 m/sec, 9491300 t fired, .

Time elapsed: 35 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 32/1796 31/32 ShieldIIPs-PT-010B-LTLFireability-11 2754677 m, 85224 m/sec, 11214633 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-010B-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPs-PT-010B-LTLFireability-13
lola: time limit : 3555 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3555 8/32 ShieldIIPs-PT-010B-LTLFireability-13 1190744 m, 238148 m/sec, 2375610 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3555 15/32 ShieldIIPs-PT-010B-LTLFireability-13 2186685 m, 199188 m/sec, 4681966 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3555 22/32 ShieldIIPs-PT-010B-LTLFireability-13 3212230 m, 205109 m/sec, 6871219 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3555 28/32 ShieldIIPs-PT-010B-LTLFireability-13 4135499 m, 184653 m/sec, 8818264 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-010B-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-010B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-010B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-010B-LTLFireability-04: F true state space / EG
ShieldIIPs-PT-010B-LTLFireability-11: LTL unknown AGGR
ShieldIIPs-PT-010B-LTLFireability-13: LTL unknown AGGR


Time elapsed: 70 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPs-PT-010B, 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 r391-oct2-167903714900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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