fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814478300404
Last Updated
May 14, 2023

About the Execution of LoLa+red for DES-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1010.199 42123.00 53507.00 553.90 FTFFFFFFFTF?FFF? normal

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.r103-tall-167814478300404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 73K Mar 5 18:22 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 DES-PT-05b-LTLFireability-00
FORMULA_NAME DES-PT-05b-LTLFireability-01
FORMULA_NAME DES-PT-05b-LTLFireability-02
FORMULA_NAME DES-PT-05b-LTLFireability-03
FORMULA_NAME DES-PT-05b-LTLFireability-04
FORMULA_NAME DES-PT-05b-LTLFireability-05
FORMULA_NAME DES-PT-05b-LTLFireability-06
FORMULA_NAME DES-PT-05b-LTLFireability-07
FORMULA_NAME DES-PT-05b-LTLFireability-08
FORMULA_NAME DES-PT-05b-LTLFireability-09
FORMULA_NAME DES-PT-05b-LTLFireability-10
FORMULA_NAME DES-PT-05b-LTLFireability-11
FORMULA_NAME DES-PT-05b-LTLFireability-12
FORMULA_NAME DES-PT-05b-LTLFireability-13
FORMULA_NAME DES-PT-05b-LTLFireability-14
FORMULA_NAME DES-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678250720944

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=DES-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:45:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:45:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:45:22] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 04:45:22] [INFO ] Transformed 300 places.
[2023-03-08 04:45:22] [INFO ] Transformed 251 transitions.
[2023-03-08 04:45:22] [INFO ] Found NUPN structural information;
[2023-03-08 04:45:22] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DES-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 274 transition count 228
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 274 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 259 transition count 213
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 259 transition count 213
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 91 place count 259 transition count 201
Applied a total of 91 rules in 57 ms. Remains 259 /300 variables (removed 41) and now considering 201/251 (removed 50) transitions.
// Phase 1: matrix 201 rows 259 cols
[2023-03-08 04:45:22] [INFO ] Computed 62 place invariants in 27 ms
[2023-03-08 04:45:23] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-08 04:45:23] [INFO ] Invariant cache hit.
[2023-03-08 04:45:23] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 666 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/300 places, 201/251 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 730 ms. Remains : 258/300 places, 201/251 transitions.
Support contains 30 out of 258 places after structural reductions.
[2023-03-08 04:45:23] [INFO ] Flatten gal took : 37 ms
[2023-03-08 04:45:23] [INFO ] Flatten gal took : 21 ms
[2023-03-08 04:45:23] [INFO ] Input system was already deterministic with 201 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 201 rows 258 cols
[2023-03-08 04:45:23] [INFO ] Computed 61 place invariants in 18 ms
[2023-03-08 04:45:23] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 04:45:23] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 04:45:23] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:45:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:45:23] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-08 04:45:24] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:45:24] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 04:45:24] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 253 transition count 178
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 235 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 235 transition count 167
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 224 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 221 transition count 164
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 221 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 221 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 220 transition count 161
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 223 place count 144 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 142 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 142 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 140 transition count 85
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 140 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 139 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 236 place count 139 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 138 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 238 place count 137 transition count 83
Applied a total of 238 rules in 62 ms. Remains 137 /258 variables (removed 121) and now considering 83/201 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 137/258 places, 83/201 transitions.
Finished random walk after 163 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
FORMULA DES-PT-05b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 79 stabilizing places and 72 stable transitions
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 182
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 182
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 237 transition count 171
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 226 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 223 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 223 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 222 transition count 165
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 215 place count 146 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 144 transition count 91
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 141 transition count 89
Applied a total of 224 rules in 43 ms. Remains 141 /258 variables (removed 117) and now considering 89/201 (removed 112) transitions.
// Phase 1: matrix 89 rows 141 cols
[2023-03-08 04:45:24] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:45:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 04:45:24] [INFO ] Invariant cache hit.
[2023-03-08 04:45:24] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-08 04:45:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:24] [INFO ] Invariant cache hit.
[2023-03-08 04:45:24] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/258 places, 89/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 141/258 places, 89/201 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s119 1), p1:(AND (EQ s56 1) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 1 reset in 5 ms.
FORMULA DES-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-00 finished in 671 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 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 252 transition count 184
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 239 transition count 184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 239 transition count 171
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 226 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 223 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 223 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 222 transition count 165
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 145 transition count 92
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 143 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 142 transition count 90
Applied a total of 222 rules in 34 ms. Remains 142 /258 variables (removed 116) and now considering 90/201 (removed 111) transitions.
// Phase 1: matrix 90 rows 142 cols
[2023-03-08 04:45:25] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:45:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:45:25] [INFO ] Invariant cache hit.
[2023-03-08 04:45:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 04:45:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:45:25] [INFO ] Invariant cache hit.
[2023-03-08 04:45:25] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/258 places, 90/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 142/258 places, 90/201 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s47 1) (AND (EQ s120 1) (EQ s138 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-02 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U X(p1)))))'
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 182
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 237 transition count 170
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 225 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 222 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 221 transition count 164
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 215 place count 146 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 144 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 141 transition count 89
Applied a total of 223 rules in 34 ms. Remains 141 /258 variables (removed 117) and now considering 89/201 (removed 112) transitions.
// Phase 1: matrix 89 rows 141 cols
[2023-03-08 04:45:25] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:45:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:45:25] [INFO ] Invariant cache hit.
[2023-03-08 04:45:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-08 04:45:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:25] [INFO ] Invariant cache hit.
[2023-03-08 04:45:25] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/258 places, 89/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 141/258 places, 89/201 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), false]
Running random walk in product with property : DES-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s41 1)), p1:(EQ s36 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11189 steps with 2052 reset in 92 ms.
FORMULA DES-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-03 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)||X(F(p1)))))||(p1 U (p2||G(p1)))))'
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 255 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 255 transition count 196
Applied a total of 8 rules in 16 ms. Remains 255 /258 variables (removed 3) and now considering 196/201 (removed 5) transitions.
// Phase 1: matrix 196 rows 255 cols
[2023-03-08 04:45:26] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 04:45:26] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 04:45:26] [INFO ] Invariant cache hit.
[2023-03-08 04:45:26] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-08 04:45:26] [INFO ] Invariant cache hit.
[2023-03-08 04:45:26] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/258 places, 196/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 255/258 places, 196/201 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}]], initial=7, aps=[p1:(EQ s236 1), p2:(AND (NEQ s244 1) (EQ s236 1)), p0:(AND (EQ s122 1) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 3 ms.
FORMULA DES-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-04 finished in 816 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||F(p1)))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 182
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 182
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 31 place count 237 transition count 169
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 224 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 221 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 213 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 143 transition count 90
Applied a total of 219 rules in 26 ms. Remains 143 /258 variables (removed 115) and now considering 90/201 (removed 111) transitions.
// Phase 1: matrix 90 rows 143 cols
[2023-03-08 04:45:27] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 04:45:27] [INFO ] Implicit Places using invariants in 87 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/258 places, 90/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 142/258 places, 90/201 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s95 0), p1:(EQ s32 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 5747 reset in 287 ms.
Product exploration explored 100000 steps with 5747 reset in 332 ms.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 200 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 209 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 62 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))]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 142 cols
[2023-03-08 04:45:28] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:45:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 04:45:28] [INFO ] Invariant cache hit.
[2023-03-08 04:45:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:28] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-08 04:45:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:28] [INFO ] Invariant cache hit.
[2023-03-08 04:45:28] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 244 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 257 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5742 reset in 245 ms.
Product exploration explored 100000 steps with 5751 reset in 251 ms.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-08 04:45:30] [INFO ] Invariant cache hit.
[2023-03-08 04:45:30] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:45:30] [INFO ] Invariant cache hit.
[2023-03-08 04:45:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:30] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:45:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:30] [INFO ] Invariant cache hit.
[2023-03-08 04:45:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 142/142 places, 90/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-05 finished in 3541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 254 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 253 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 253 transition count 194
Applied a total of 12 rules in 8 ms. Remains 253 /258 variables (removed 5) and now considering 194/201 (removed 7) transitions.
// Phase 1: matrix 194 rows 253 cols
[2023-03-08 04:45:30] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 04:45:30] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 04:45:30] [INFO ] Invariant cache hit.
[2023-03-08 04:45:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 04:45:30] [INFO ] Invariant cache hit.
[2023-03-08 04:45:30] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/258 places, 194/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 253/258 places, 194/201 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-10 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 182
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 237 transition count 170
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 225 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 222 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 221 transition count 164
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 213 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 143 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 142 transition count 90
Applied a total of 220 rules in 33 ms. Remains 142 /258 variables (removed 116) and now considering 90/201 (removed 111) transitions.
// Phase 1: matrix 90 rows 142 cols
[2023-03-08 04:45:31] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:45:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 04:45:31] [INFO ] Invariant cache hit.
[2023-03-08 04:45:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-08 04:45:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:31] [INFO ] Invariant cache hit.
[2023-03-08 04:45:31] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/258 places, 90/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 142/258 places, 90/201 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s59 0) (AND (EQ s19 1) (EQ s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4449 reset in 275 ms.
Product exploration explored 100000 steps with 4448 reset in 228 ms.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-08 04:45:32] [INFO ] Invariant cache hit.
[2023-03-08 04:45:32] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 04:45:32] [INFO ] Invariant cache hit.
[2023-03-08 04:45:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 04:45:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:32] [INFO ] Invariant cache hit.
[2023-03-08 04:45:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4479 reset in 207 ms.
Product exploration explored 100000 steps with 4471 reset in 205 ms.
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-08 04:45:33] [INFO ] Invariant cache hit.
[2023-03-08 04:45:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:45:33] [INFO ] Invariant cache hit.
[2023-03-08 04:45:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:33] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 04:45:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:45:33] [INFO ] Invariant cache hit.
[2023-03-08 04:45:33] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 142/142 places, 90/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-11 finished in 2565 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(G((!p0||G((p0||F(p1))))))))'
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 253 transition count 182
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 237 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 237 transition count 170
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 225 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 223 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 223 transition count 168
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 215 place count 146 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 219 place count 144 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 144 transition count 92
Applied a total of 223 rules in 22 ms. Remains 144 /258 variables (removed 114) and now considering 92/201 (removed 109) transitions.
// Phase 1: matrix 92 rows 144 cols
[2023-03-08 04:45:33] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 04:45:33] [INFO ] Implicit Places using invariants in 78 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/258 places, 92/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 143/258 places, 92/201 transitions.
Stuttering acceptance computed with spot in 134 ms :[false, false, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s53 1)), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 92 steps with 4 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-13 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(X((!F(X(p1)) U p2))&&p0))))'
Support contains 5 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 254 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 253 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 253 transition count 194
Applied a total of 12 rules in 15 ms. Remains 253 /258 variables (removed 5) and now considering 194/201 (removed 7) transitions.
// Phase 1: matrix 194 rows 253 cols
[2023-03-08 04:45:33] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 04:45:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:45:33] [INFO ] Invariant cache hit.
[2023-03-08 04:45:34] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 04:45:34] [INFO ] Invariant cache hit.
[2023-03-08 04:45:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/258 places, 194/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 253/258 places, 194/201 transitions.
Stuttering acceptance computed with spot in 336 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (OR (NOT p2) p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=p1, acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(AND (EQ s159 1) (EQ s193 1)), p0:(EQ s222 1), p2:(AND (EQ s26 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-14 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 254 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 253 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 253 transition count 194
Applied a total of 12 rules in 7 ms. Remains 253 /258 variables (removed 5) and now considering 194/201 (removed 7) transitions.
[2023-03-08 04:45:34] [INFO ] Invariant cache hit.
[2023-03-08 04:45:34] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 04:45:34] [INFO ] Invariant cache hit.
[2023-03-08 04:45:34] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 04:45:34] [INFO ] Invariant cache hit.
[2023-03-08 04:45:35] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/258 places, 194/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 253/258 places, 194/201 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s60 0), p0:(EQ s155 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 879 reset in 170 ms.
Product exploration explored 100000 steps with 888 reset in 174 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 247 transition count 175
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 232 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 232 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 201 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 205 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 143 transition count 90
Applied a total of 207 rules in 21 ms. Remains 143 /253 variables (removed 110) and now considering 90/194 (removed 104) transitions.
// Phase 1: matrix 90 rows 143 cols
[2023-03-08 04:45:36] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 04:45:36] [INFO ] Implicit Places using invariants in 93 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/253 places, 90/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 142/253 places, 90/194 transitions.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4479 reset in 191 ms.
Product exploration explored 100000 steps with 4464 reset in 206 ms.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 88
Applied a total of 1 rules in 5 ms. Remains 140 /142 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 140 cols
[2023-03-08 04:45:37] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:45:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 04:45:37] [INFO ] Invariant cache hit.
[2023-03-08 04:45:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 04:45:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:45:37] [INFO ] Invariant cache hit.
[2023-03-08 04:45:37] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/142 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 140/142 places, 88/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-15 finished in 2812 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||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Found a Shortening insensitive property : DES-PT-05b-LTLFireability-15
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 258/258 places, 201/201 transitions.
Graph (complete) has 476 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 252 transition count 181
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 236 transition count 181
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 236 transition count 169
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 224 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 221 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 213 place count 147 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 217 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 143 transition count 90
Applied a total of 219 rules in 25 ms. Remains 143 /258 variables (removed 115) and now considering 90/201 (removed 111) transitions.
// Phase 1: matrix 90 rows 143 cols
[2023-03-08 04:45:37] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-08 04:45:37] [INFO ] Implicit Places using invariants in 76 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 142/258 places, 90/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 104 ms. Remains : 142/258 places, 90/201 transitions.
Running random walk in product with property : DES-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s32 0), p0:(EQ s79 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5116 reset in 193 ms.
Product exploration explored 100000 steps with 5060 reset in 218 ms.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 142 cols
[2023-03-08 04:45:39] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:45:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 04:45:39] [INFO ] Invariant cache hit.
[2023-03-08 04:45:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 04:45:39] [INFO ] Invariant cache hit.
[2023-03-08 04:45:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5153 reset in 200 ms.
Product exploration explored 100000 steps with 5083 reset in 221 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-08 04:45:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:45:41] [INFO ] Invariant cache hit.
[2023-03-08 04:45:41] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 142/142 places, 90/90 transitions.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-08 04:45:41] [INFO ] Invariant cache hit.
[2023-03-08 04:45:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:45:41] [INFO ] Invariant cache hit.
[2023-03-08 04:45:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 04:45:41] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 04:45:41] [INFO ] Invariant cache hit.
[2023-03-08 04:45:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 142/142 places, 90/90 transitions.
Treatment of property DES-PT-05b-LTLFireability-15 finished in 4255 ms.
[2023-03-08 04:45:41] [INFO ] Flatten gal took : 12 ms
[2023-03-08 04:45:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 04:45:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 201 transitions and 617 arcs took 2 ms.
Total runtime 19647 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-05b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DES-PT-05b-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678250763067

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 9 (type EXCL) for 6 DES-PT-05b-LTLFireability-15
lola: time limit : 899 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
DES-PT-05b-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
DES-PT-05b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
DES-PT-05b-LTLFireability-15: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 5/899 19/32 DES-PT-05b-LTLFireability-15 2833476 m, 566695 m/sec, 3537613 t fired, .

Time elapsed: 6 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 9 (type EXCL) for DES-PT-05b-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-05b-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
DES-PT-05b-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
DES-PT-05b-LTLFireability-15: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 11 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 6 DES-PT-05b-LTLFireability-15
lola: time limit : 1196 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for DES-PT-05b-LTLFireability-15
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-05b-LTLFireability-05
lola: time limit : 1794 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-05b-LTLFireability-05
lola: result : false
lola: markings : 10439
lola: fired transitions : 11403
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-05b-LTLFireability-11
lola: time limit : 3589 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-05b-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-05b-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
DES-PT-05b-LTLFireability-15: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3589 20/32 DES-PT-05b-LTLFireability-11 2943963 m, 588792 m/sec, 3686956 t fired, .

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for DES-PT-05b-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-05b-LTLFireability-05: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-05b-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
DES-PT-05b-LTLFireability-15: CONJ 0 0 0 0 3 0 1 0

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

Time elapsed: 21 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
DES-PT-05b-LTLFireability-05: LTL false LTL model checker
DES-PT-05b-LTLFireability-11: LTL unknown AGGR
DES-PT-05b-LTLFireability-15: CONJ unknown CONJ


Time elapsed: 21 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="DES-PT-05b"
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 DES-PT-05b, 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 r103-tall-167814478300404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;