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.r007-oct2-167813595300284.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AirplaneLD-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595300284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 310K Feb 26 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 222K Feb 26 11:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 167K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 428K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 410K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 478K Feb 26 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 26 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 381K Feb 26 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Feb 26 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.2M 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 AirplaneLD-PT-0500-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678345806568

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=AirplaneLD-PT-0500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 07:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:10:09] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-03-09 07:10:09] [INFO ] Transformed 3519 places.
[2023-03-09 07:10:09] [INFO ] Transformed 4008 transitions.
[2023-03-09 07:10:09] [INFO ] Parsed PT model containing 3519 places and 4008 transitions and 15278 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 1502 places and 0 transitions.
FORMULA AirplaneLD-PT-0500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0500-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1269 out of 2017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2017/2017 places, 4008/4008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2014 transition count 4008
Discarding 741 places :
Symmetric choice reduction at 1 with 741 rule applications. Total rules 744 place count 1273 transition count 3267
Iterating global reduction 1 with 741 rules applied. Total rules applied 1485 place count 1273 transition count 3267
Ensure Unique test removed 741 transitions
Reduce isomorphic transitions removed 741 transitions.
Iterating post reduction 1 with 741 rules applied. Total rules applied 2226 place count 1273 transition count 2526
Applied a total of 2226 rules in 75 ms. Remains 1273 /2017 variables (removed 744) and now considering 2526/4008 (removed 1482) transitions.
// Phase 1: matrix 2526 rows 1273 cols
[2023-03-09 07:10:10] [INFO ] Computed 1 place invariants in 294 ms
[2023-03-09 07:10:10] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-09 07:10:10] [INFO ] Invariant cache hit.
[2023-03-09 07:10:12] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
[2023-03-09 07:10:12] [INFO ] Invariant cache hit.
[2023-03-09 07:10:14] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1273/2017 places, 2526/4008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4034 ms. Remains : 1273/2017 places, 2526/4008 transitions.
Support contains 1269 out of 1273 places after structural reductions.
[2023-03-09 07:10:14] [INFO ] Flatten gal took : 180 ms
[2023-03-09 07:10:14] [INFO ] Flatten gal took : 125 ms
[2023-03-09 07:10:15] [INFO ] Input system was already deterministic with 2526 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 1486 ms. (steps per millisecond=6 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 07:10:17] [INFO ] Invariant cache hit.
[2023-03-09 07:10:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:10:20] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 07:10:20] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:10:22] [INFO ] After 1929ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-09 07:10:24] [INFO ] After 3035ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 708 ms.
[2023-03-09 07:10:24] [INFO ] After 4300ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 5 properties in 28 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1273 stabilizing places and 2526 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1273 transition count 2526
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(!p1)||(!p1&&F(!p2))||p0))))'
Support contains 254 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1003 places :
Symmetric choice reduction at 0 with 1003 rule applications. Total rules 1003 place count 270 transition count 1523
Iterating global reduction 0 with 1003 rules applied. Total rules applied 2006 place count 270 transition count 1523
Ensure Unique test removed 1003 transitions
Reduce isomorphic transitions removed 1003 transitions.
Iterating post reduction 0 with 1003 rules applied. Total rules applied 3009 place count 270 transition count 520
Applied a total of 3009 rules in 40 ms. Remains 270 /1273 variables (removed 1003) and now considering 520/2526 (removed 2006) transitions.
// Phase 1: matrix 520 rows 270 cols
[2023-03-09 07:10:25] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-09 07:10:25] [INFO ] Implicit Places using invariants in 100 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 269/1273 places, 520/2526 transitions.
Applied a total of 0 rules in 2 ms. Remains 269 /269 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 269/1273 places, 520/2526 transitions.
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), true, (AND p1 p2), p2]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1)), p1:(AND (GEQ s2 1) (GEQ s3 1)), p2:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s86 1)) (AND (GEQ s11 1) (GEQ s151...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 1 reset in 8 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-01 finished in 766 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 1 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Graph (complete) has 1772 edges and 1273 vertex of which 1 are kept as prefixes of interest. Removing 1272 places using SCC suffix rule.13 ms
Discarding 1272 places :
Also discarding 2272 output transitions
Drop transitions removed 2272 transitions
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 1 transition count 1
Applied a total of 254 rules in 20 ms. Remains 1 /1273 variables (removed 1272) and now considering 1/2526 (removed 2525) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-09 07:10:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:10:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 07:10:26] [INFO ] Invariant cache hit.
[2023-03-09 07:10:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 07:10:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:10:26] [INFO ] Invariant cache hit.
[2023-03-09 07:10:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1273 places, 1/2526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 1/1273 places, 1/2526 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 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 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-02 finished in 716 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 252 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1003 places :
Symmetric choice reduction at 0 with 1003 rule applications. Total rules 1003 place count 270 transition count 1523
Iterating global reduction 0 with 1003 rules applied. Total rules applied 2006 place count 270 transition count 1523
Ensure Unique test removed 1003 transitions
Reduce isomorphic transitions removed 1003 transitions.
Iterating post reduction 0 with 1003 rules applied. Total rules applied 3009 place count 270 transition count 520
Applied a total of 3009 rules in 51 ms. Remains 270 /1273 variables (removed 1003) and now considering 520/2526 (removed 2006) transitions.
// Phase 1: matrix 520 rows 270 cols
[2023-03-09 07:10:26] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-09 07:10:27] [INFO ] Implicit Places using invariants in 125 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/1273 places, 520/2526 transitions.
Graph (complete) has 267 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop 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 0 with 1 rules applied. Total rules applied 2 place count 268 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 267 transition count 518
Applied a total of 3 rules in 9 ms. Remains 267 /269 variables (removed 2) and now considering 518/520 (removed 2) transitions.
// Phase 1: matrix 518 rows 267 cols
[2023-03-09 07:10:27] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-09 07:10:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 07:10:27] [INFO ] Invariant cache hit.
[2023-03-09 07:10:27] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 267/1273 places, 518/2526 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 461 ms. Remains : 267/1273 places, 518/2526 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-03 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 (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s9 1) (GEQ s84 1)) (AND (GEQ s9 1) (GEQ s149 1)) (AND (GEQ s9 1) (GEQ s214 1)) (AND (GEQ s9 1) (GEQ s11 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-03 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 503 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Graph (complete) has 1772 edges and 1273 vertex of which 1011 are kept as prefixes of interest. Removing 262 places using SCC suffix rule.7 ms
Discarding 262 places :
Also discarding 264 output transitions
Drop transitions removed 264 transitions
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 1011 transition count 2009
Discarding 498 places :
Symmetric choice reduction at 1 with 498 rule applications. Total rules 752 place count 513 transition count 1511
Iterating global reduction 1 with 498 rules applied. Total rules applied 1250 place count 513 transition count 1511
Ensure Unique test removed 498 transitions
Reduce isomorphic transitions removed 498 transitions.
Iterating post reduction 1 with 498 rules applied. Total rules applied 1748 place count 513 transition count 1013
Applied a total of 1748 rules in 52 ms. Remains 513 /1273 variables (removed 760) and now considering 1013/2526 (removed 1513) transitions.
// Phase 1: matrix 1013 rows 513 cols
[2023-03-09 07:10:27] [INFO ] Computed 1 place invariants in 108 ms
[2023-03-09 07:10:27] [INFO ] Implicit Places using invariants in 264 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/1273 places, 1013/2526 transitions.
Graph (complete) has 509 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop 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 0 with 1 rules applied. Total rules applied 2 place count 511 transition count 1011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 510 transition count 1011
Applied a total of 3 rules in 26 ms. Remains 510 /512 variables (removed 2) and now considering 1011/1013 (removed 2) transitions.
// Phase 1: matrix 1011 rows 510 cols
[2023-03-09 07:10:27] [INFO ] Computed 0 place invariants in 67 ms
[2023-03-09 07:10:28] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-09 07:10:28] [INFO ] Invariant cache hit.
[2023-03-09 07:10:28] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/1273 places, 1011/2526 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 907 ms. Remains : 510/1273 places, 1011/2526 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s509 1) (OR (AND (GEQ s3 1) (GEQ s25 1)) (AND (GEQ s3 1) (GEQ s155 1)) (AND (GEQ s3 1) (GEQ s285 1)) (AND (GEQ s3 1) (GEQ s415 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-04 finished in 1078 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 p1)&&X(((F(p3) U p1)&&p2))))'
Support contains 6 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1251 places :
Symmetric choice reduction at 0 with 1251 rule applications. Total rules 1251 place count 22 transition count 1275
Iterating global reduction 0 with 1251 rules applied. Total rules applied 2502 place count 22 transition count 1275
Ensure Unique test removed 1251 transitions
Reduce isomorphic transitions removed 1251 transitions.
Iterating post reduction 0 with 1251 rules applied. Total rules applied 3753 place count 22 transition count 24
Applied a total of 3753 rules in 45 ms. Remains 22 /1273 variables (removed 1251) and now considering 24/2526 (removed 2502) transitions.
// Phase 1: matrix 24 rows 22 cols
[2023-03-09 07:10:28] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:10:28] [INFO ] Implicit Places using invariants in 59 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/1273 places, 24/2526 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 21/1273 places, 24/2526 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s12 1)), p0:(GEQ s20 1), p2:(AND (GEQ s13 1) (GEQ s15 1)), p3:(AND (GEQ s8 1) (GEQ s10 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-08 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(!p1) U p0))))))'
Support contains 1 out of 1273 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 : 1273/1273 places, 2526/2526 transitions.
Graph (complete) has 1772 edges and 1273 vertex of which 4 are kept as prefixes of interest. Removing 1269 places using SCC suffix rule.6 ms
Discarding 1269 places :
Also discarding 2522 output transitions
Drop transitions removed 2522 transitions
Applied a total of 1 rules in 19 ms. Remains 4 /1273 variables (removed 1269) and now considering 4/2526 (removed 2522) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-09 07:10:29] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:10:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 07:10:29] [INFO ] Invariant cache hit.
[2023-03-09 07:10:29] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-09 07:10:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:10:29] [INFO ] Invariant cache hit.
[2023-03-09 07:10:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1273 places, 4/2526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 4/1273 places, 4/2526 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-10 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0))) U (p1 U (F(!p2) U G(!p3)))) U p0))'
Support contains 6 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1252 places :
Symmetric choice reduction at 0 with 1252 rule applications. Total rules 1252 place count 21 transition count 1274
Iterating global reduction 0 with 1252 rules applied. Total rules applied 2504 place count 21 transition count 1274
Ensure Unique test removed 1252 transitions
Reduce isomorphic transitions removed 1252 transitions.
Iterating post reduction 0 with 1252 rules applied. Total rules applied 3756 place count 21 transition count 22
Applied a total of 3756 rules in 46 ms. Remains 21 /1273 variables (removed 1252) and now considering 22/2526 (removed 2504) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:10:29] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:10:29] [INFO ] Implicit Places using invariants in 69 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/1273 places, 22/2526 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 20/1273 places, 22/2526 transitions.
Stuttering acceptance computed with spot in 1019 ms :[(NOT p0), (AND (NOT p0) p3), p3, (AND (NOT p0) p3), (AND p2 (NOT p0) (NOT p3)), (AND (NOT p0) p3), (AND p2 (NOT p3) (NOT p0)), (AND (NOT p0) p3), (AND (NOT p0) p3), (AND p2 (NOT p0) (NOT p3)), (AND (NOT p0) p3), p2, p3, p3]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p3 p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 8}, { cond=(AND p3 p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=p1, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=8 dest: 11}, { cond=(NOT p0), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 13}], [{ cond=p2, acceptance={0} source=11 dest: 11}], [{ cond=(AND p3 p2), acceptance={} source=12 dest: 11}, { cond=(NOT p3), acceptance={} source=12 dest: 12}, { cond=p3, acceptance={0} source=12 dest: 12}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=13 dest: 11}, { cond=(NOT p1), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) p1), acceptance={} source=13 dest: 13}, { cond=(AND p3 p1), acceptance={0} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s11 1) (GEQ s13 1)), p3:(LT s18 1), p2:(AND (GEQ s11 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-11 finished in 1236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Graph (complete) has 1772 edges and 1273 vertex of which 1010 are kept as prefixes of interest. Removing 263 places using SCC suffix rule.5 ms
Discarding 263 places :
Also discarding 518 output transitions
Drop transitions removed 518 transitions
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 999 place count 12 transition count 1010
Iterating global reduction 0 with 998 rules applied. Total rules applied 1997 place count 12 transition count 1010
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 998 rules applied. Total rules applied 2995 place count 12 transition count 12
Applied a total of 2995 rules in 62 ms. Remains 12 /1273 variables (removed 1261) and now considering 12/2526 (removed 2514) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-09 07:10:30] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:10:30] [INFO ] Implicit Places using invariants in 39 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/1273 places, 12/2526 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 10 /11 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-09 07:10:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:10:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 07:10:30] [INFO ] Invariant cache hit.
[2023-03-09 07:10:30] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1273 places, 11/2526 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 10/1273 places, 11/2526 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s6 1) (AND (GEQ s1 1) (GEQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19048 reset in 122 ms.
Product exploration explored 100000 steps with 19052 reset in 116 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0500-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-12 finished in 788 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 U (p1||G(!p0)))||(p2&&X(!p0)))))'
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1252 places :
Symmetric choice reduction at 0 with 1252 rule applications. Total rules 1252 place count 21 transition count 1274
Iterating global reduction 0 with 1252 rules applied. Total rules applied 2504 place count 21 transition count 1274
Ensure Unique test removed 1252 transitions
Reduce isomorphic transitions removed 1252 transitions.
Iterating post reduction 0 with 1252 rules applied. Total rules applied 3756 place count 21 transition count 22
Applied a total of 3756 rules in 27 ms. Remains 21 /1273 variables (removed 1252) and now considering 22/2526 (removed 2504) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:10:31] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-09 07:10:31] [INFO ] Implicit Places using invariants in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/1273 places, 22/2526 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 20/1273 places, 22/2526 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s12 1) (LT s14 1)), p1:(AND (LT s18 1) (NOT (AND (GEQ s8 1) (GEQ s11 1)))), p0:(AND (GEQ s8 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 20 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 10 factoid took 587 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0500-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0500-LTLFireability-13 finished in 1085 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(p1) U p2)&&p0) U X(p3)))'
Support contains 7 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2526/2526 transitions.
Discarding 1254 places :
Symmetric choice reduction at 0 with 1254 rule applications. Total rules 1254 place count 19 transition count 1272
Iterating global reduction 0 with 1254 rules applied. Total rules applied 2508 place count 19 transition count 1272
Ensure Unique test removed 1254 transitions
Reduce isomorphic transitions removed 1254 transitions.
Iterating post reduction 0 with 1254 rules applied. Total rules applied 3762 place count 19 transition count 18
Applied a total of 3762 rules in 14 ms. Remains 19 /1273 variables (removed 1254) and now considering 18/2526 (removed 2508) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:10:32] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:10:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 07:10:32] [INFO ] Invariant cache hit.
[2023-03-09 07:10:32] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-09 07:10:32] [INFO ] Invariant cache hit.
[2023-03-09 07:10:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/1273 places, 18/2526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 19/1273 places, 18/2526 transitions.
Stuttering acceptance computed with spot in 406 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s18 1)), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s1 1) (GEQ s2 1)), p3:(AND (GEQ s16 1) (GEQ s15 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 0 ms.
FORMULA AirplaneLD-PT-0500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0500-LTLFireability-15 finished in 689 ms.
All properties solved by simple procedures.
Total runtime 23885 ms.
ITS solved all properties within timeout

BK_STOP 1678345833692

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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="AirplaneLD-PT-0500"
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 AirplaneLD-PT-0500, 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 r007-oct2-167813595300284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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