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.r009-oct2-167813597700292.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 ltsminxred
Input is AirplaneLD-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597700292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 589K Feb 26 12:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 12:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 235K Feb 26 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:54 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 425K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 103K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 450K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 554K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 168K 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 4.3M 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-1000-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678621448112

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-1000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:44:10] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2023-03-12 11:44:11] [INFO ] Transformed 7019 places.
[2023-03-12 11:44:11] [INFO ] Transformed 8008 transitions.
[2023-03-12 11:44:11] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 552 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 3002 places and 0 transitions.
FORMULA AirplaneLD-PT-1000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3513 out of 4017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4014 transition count 8008
Discarding 500 places :
Symmetric choice reduction at 1 with 500 rule applications. Total rules 503 place count 3514 transition count 7508
Iterating global reduction 1 with 500 rules applied. Total rules applied 1003 place count 3514 transition count 7508
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1503 place count 3514 transition count 7008
Applied a total of 1503 rules in 248 ms. Remains 3514 /4017 variables (removed 503) and now considering 7008/8008 (removed 1000) transitions.
// Phase 1: matrix 7008 rows 3514 cols
[2023-03-12 11:44:13] [INFO ] Computed 1 place invariants in 1501 ms
[2023-03-12 11:44:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 11:44:14] [INFO ] Implicit Places using invariants in 2259 ms returned []
[2023-03-12 11:44:14] [INFO ] Invariant cache hit.
[2023-03-12 11:44:15] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 3576 ms to find 0 implicit places.
[2023-03-12 11:44:15] [INFO ] Invariant cache hit.
[2023-03-12 11:44:20] [INFO ] Dead Transitions using invariants and state equation in 5006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3514/4017 places, 7008/8008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8854 ms. Remains : 3514/4017 places, 7008/8008 transitions.
Support contains 3513 out of 3514 places after structural reductions.
[2023-03-12 11:44:21] [INFO ] Flatten gal took : 544 ms
[2023-03-12 11:44:21] [INFO ] Flatten gal took : 263 ms
[2023-03-12 11:44:22] [INFO ] Input system was already deterministic with 7008 transitions.
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 2534 ms. (steps per millisecond=3 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 11:44:25] [INFO ] Invariant cache hit.
[2023-03-12 11:44:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:44:29] [INFO ] After 3344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 11:44:30] [INFO ] After 3743ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-12 11:44:30] [INFO ] After 4807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-12 11:44:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:44:34] [INFO ] After 3487ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 11:44:36] [INFO ] After 4810ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 815 ms.
[2023-03-12 11:44:37] [INFO ] After 6615ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 31 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AirplaneLD-PT-1000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-1000-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3514 stabilizing places and 7008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3514 transition count 7008
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' '!((F(p0)&&X(G(p1))))'
Support contains 502 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 2996 places :
Symmetric choice reduction at 0 with 2996 rule applications. Total rules 2996 place count 518 transition count 4012
Iterating global reduction 0 with 2996 rules applied. Total rules applied 5992 place count 518 transition count 4012
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 8988 place count 518 transition count 1016
Applied a total of 8988 rules in 79 ms. Remains 518 /3514 variables (removed 2996) and now considering 1016/7008 (removed 5992) transitions.
// Phase 1: matrix 1016 rows 518 cols
[2023-03-12 11:44:37] [INFO ] Computed 1 place invariants in 62 ms
[2023-03-12 11:44:37] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 11:44:37] [INFO ] Invariant cache hit.
[2023-03-12 11:44:38] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-12 11:44:38] [INFO ] Invariant cache hit.
[2023-03-12 11:44:38] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 518/3514 places, 1016/7008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 518/3514 places, 1016/7008 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s511 1) (LT s517 1)), p0:(OR (AND (GEQ s307 1) (GEQ s513 1)) (AND (GEQ s53 1) (GEQ s513 1)) (AND (GEQ s82 1) (GEQ s513 1)) (AND (GEQ s503 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 19 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-00 finished in 1462 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)&&(!p1 U (p2||G(!p1)))))'
Support contains 503 out of 3514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Graph (complete) has 5012 edges and 3514 vertex of which 3013 are kept as prefixes of interest. Removing 501 places using SCC suffix rule.27 ms
Discarding 501 places :
Also discarding 500 output transitions
Drop transitions removed 500 transitions
Ensure Unique test removed 499 transitions
Reduce isomorphic transitions removed 499 transitions.
Iterating post reduction 0 with 499 rules applied. Total rules applied 500 place count 3013 transition count 6009
Discarding 2498 places :
Symmetric choice reduction at 1 with 2498 rule applications. Total rules 2998 place count 515 transition count 3511
Iterating global reduction 1 with 2498 rules applied. Total rules applied 5496 place count 515 transition count 3511
Ensure Unique test removed 2498 transitions
Reduce isomorphic transitions removed 2498 transitions.
Iterating post reduction 1 with 2498 rules applied. Total rules applied 7994 place count 515 transition count 1013
Applied a total of 7994 rules in 125 ms. Remains 515 /3514 variables (removed 2999) and now considering 1013/7008 (removed 5995) transitions.
// Phase 1: matrix 1013 rows 515 cols
[2023-03-12 11:44:39] [INFO ] Computed 1 place invariants in 49 ms
[2023-03-12 11:44:39] [INFO ] Implicit Places using invariants in 138 ms returned [514]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/3514 places, 1013/7008 transitions.
Graph (complete) has 511 edges and 514 vertex of which 513 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
Applied a total of 1 rules in 13 ms. Remains 513 /514 variables (removed 1) and now considering 1012/1013 (removed 1) transitions.
// Phase 1: matrix 1012 rows 513 cols
[2023-03-12 11:44:39] [INFO ] Computed 0 place invariants in 42 ms
[2023-03-12 11:44:39] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 11:44:39] [INFO ] Invariant cache hit.
[2023-03-12 11:44:39] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 513/3514 places, 1012/7008 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 730 ms. Remains : 513/3514 places, 1012/7008 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NOT (OR (GEQ s501 1) (GEQ s501 1) (GEQ s501 1) (GEQ s501 1) (GEQ s501 1) (GEQ s501 1) (AND (GEQ s507 1) (GEQ s512 1)))) (NOT (AND (GEQ s507 1) (G...], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 218 steps with 41 reset in 17 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-01 finished in 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 1003 out of 3514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Graph (complete) has 5012 edges and 3514 vertex of which 2010 are kept as prefixes of interest. Removing 1504 places using SCC suffix rule.8 ms
Discarding 1504 places :
Also discarding 3000 output transitions
Drop transitions removed 3000 transitions
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 999 place count 1012 transition count 3010
Iterating global reduction 0 with 998 rules applied. Total rules applied 1997 place count 1012 transition count 3010
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 1012 transition count 2012
Applied a total of 2995 rules in 148 ms. Remains 1012 /3514 variables (removed 2502) and now considering 2012/7008 (removed 4996) transitions.
// Phase 1: matrix 2012 rows 1012 cols
[2023-03-12 11:44:40] [INFO ] Computed 1 place invariants in 174 ms
[2023-03-12 11:44:40] [INFO ] Implicit Places using invariants in 402 ms returned [1011]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 405 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/3514 places, 2012/7008 transitions.
Graph (complete) has 1009 edges and 1011 vertex of which 1010 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 1010 transition count 2010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1009 transition count 2010
Applied a total of 3 rules in 31 ms. Remains 1009 /1011 variables (removed 2) and now considering 2010/2012 (removed 2) transitions.
// Phase 1: matrix 2010 rows 1009 cols
[2023-03-12 11:44:40] [INFO ] Computed 0 place invariants in 180 ms
[2023-03-12 11:44:41] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 11:44:41] [INFO ] Invariant cache hit.
[2023-03-12 11:44:42] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1009/3514 places, 2010/7008 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2160 ms. Remains : 1009/3514 places, 2010/7008 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-02 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:(GEQ s1003 1), p1:(AND (OR (LT s300 1) (LT s1007 1)) (OR (LT s779 1) (LT s1007 1)) (OR (LT s837 1) (LT s1007 1)) (OR (LT s358 1) (LT s1007 1)) (OR (LT ...], 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 21036 reset in 8512 ms.
Product exploration explored 100000 steps with 21077 reset in 8301 ms.
Computed a total of 1009 stabilizing places and 2010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1009 transition count 2010
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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-02 finished in 20480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(G(p1)||F(!p2)))))'
Support contains 1003 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 2497 places :
Symmetric choice reduction at 0 with 2497 rule applications. Total rules 2497 place count 1017 transition count 4511
Iterating global reduction 0 with 2497 rules applied. Total rules applied 4994 place count 1017 transition count 4511
Ensure Unique test removed 2497 transitions
Reduce isomorphic transitions removed 2497 transitions.
Iterating post reduction 0 with 2497 rules applied. Total rules applied 7491 place count 1017 transition count 2014
Applied a total of 7491 rules in 62 ms. Remains 1017 /3514 variables (removed 2497) and now considering 2014/7008 (removed 4994) transitions.
// Phase 1: matrix 2014 rows 1017 cols
[2023-03-12 11:45:00] [INFO ] Computed 1 place invariants in 125 ms
[2023-03-12 11:45:01] [INFO ] Implicit Places using invariants in 417 ms returned [1016]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1016/3514 places, 2014/7008 transitions.
Applied a total of 0 rules in 22 ms. Remains 1016 /1016 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 503 ms. Remains : 1016/3514 places, 2014/7008 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (NOT p0), p2, (AND p2 (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1007 1) (LT s1015 1)), p1:(OR (AND (GEQ s416 1) (GEQ s1013 1)) (AND (GEQ s162 1) (GEQ s1013 1)) (AND (GEQ s191 1) (GEQ s1013 1)) (AND (GEQ s38...], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-04 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 3495 places :
Symmetric choice reduction at 0 with 3495 rule applications. Total rules 3495 place count 19 transition count 3513
Iterating global reduction 0 with 3495 rules applied. Total rules applied 6990 place count 19 transition count 3513
Ensure Unique test removed 3495 transitions
Reduce isomorphic transitions removed 3495 transitions.
Iterating post reduction 0 with 3495 rules applied. Total rules applied 10485 place count 19 transition count 18
Applied a total of 10485 rules in 43 ms. Remains 19 /3514 variables (removed 3495) and now considering 18/7008 (removed 6990) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:45:01] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:01] [INFO ] Implicit Places using invariants in 93 ms returned [18]
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 : 18/3514 places, 18/7008 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 18/3514 places, 18/7008 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-06 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((F(G(p0))||p1))))))'
Support contains 3 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 3495 places :
Symmetric choice reduction at 0 with 3495 rule applications. Total rules 3495 place count 19 transition count 3513
Iterating global reduction 0 with 3495 rules applied. Total rules applied 6990 place count 19 transition count 3513
Ensure Unique test removed 3495 transitions
Reduce isomorphic transitions removed 3495 transitions.
Iterating post reduction 0 with 3495 rules applied. Total rules applied 10485 place count 19 transition count 18
Applied a total of 10485 rules in 71 ms. Remains 19 /3514 variables (removed 3495) and now considering 18/7008 (removed 6990) transitions.
[2023-03-12 11:45:01] [INFO ] Invariant cache hit.
[2023-03-12 11:45:01] [INFO ] Implicit Places using invariants in 35 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3514 places, 18/7008 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 18/3514 places, 18/7008 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s11 1), p1:(OR (LT s10 1) (LT s17 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]]
Product exploration explored 100000 steps with 36001 reset in 62 ms.
Product exploration explored 100000 steps with 36019 reset in 65 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-07 finished in 751 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((X(X(F(!p0)))||(!p1&&G(p2)))))'
Support contains 3 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 3495 places :
Symmetric choice reduction at 0 with 3495 rule applications. Total rules 3495 place count 19 transition count 3513
Iterating global reduction 0 with 3495 rules applied. Total rules applied 6990 place count 19 transition count 3513
Ensure Unique test removed 3495 transitions
Reduce isomorphic transitions removed 3495 transitions.
Iterating post reduction 0 with 3495 rules applied. Total rules applied 10485 place count 19 transition count 18
Applied a total of 10485 rules in 121 ms. Remains 19 /3514 variables (removed 3495) and now considering 18/7008 (removed 6990) transitions.
[2023-03-12 11:45:02] [INFO ] Invariant cache hit.
[2023-03-12 11:45:02] [INFO ] Implicit Places using invariants in 67 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3514 places, 18/7008 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 18/3514 places, 18/7008 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s11 1), p2:(LT s3 1), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23718 reset in 97 ms.
Product exploration explored 100000 steps with 23719 reset in 135 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 (NOT p1) (NOT p2) p0), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X p2), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 560 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-08 finished in 1324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(p1))))'
Support contains 4 out of 3514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Graph (complete) has 5012 edges and 3514 vertex of which 3012 are kept as prefixes of interest. Removing 502 places using SCC suffix rule.27 ms
Discarding 502 places :
Also discarding 1000 output transitions
Drop transitions removed 1000 transitions
Discarding 2996 places :
Symmetric choice reduction at 0 with 2996 rule applications. Total rules 2997 place count 16 transition count 3012
Iterating global reduction 0 with 2996 rules applied. Total rules applied 5993 place count 16 transition count 3012
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 8989 place count 16 transition count 16
Applied a total of 8989 rules in 123 ms. Remains 16 /3514 variables (removed 3498) and now considering 16/7008 (removed 6992) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:45:03] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 11:45:03] [INFO ] Invariant cache hit.
[2023-03-12 11:45:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-12 11:45:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:45:03] [INFO ] Invariant cache hit.
[2023-03-12 11:45:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/3514 places, 16/7008 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 16/3514 places, 16/7008 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s15 1)), p1:(AND (GEQ s2 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-10 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(p1)&&G(p2)))&&p0))))'
Support contains 5 out of 3514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Discarding 3493 places :
Symmetric choice reduction at 0 with 3493 rule applications. Total rules 3493 place count 21 transition count 3515
Iterating global reduction 0 with 3493 rules applied. Total rules applied 6986 place count 21 transition count 3515
Ensure Unique test removed 3493 transitions
Reduce isomorphic transitions removed 3493 transitions.
Iterating post reduction 0 with 3493 rules applied. Total rules applied 10479 place count 21 transition count 22
Applied a total of 10479 rules in 67 ms. Remains 21 /3514 variables (removed 3493) and now considering 22/7008 (removed 6986) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-12 11:45:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:04] [INFO ] Implicit Places using invariants in 135 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3514 places, 22/7008 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 204 ms. Remains : 20/3514 places, 22/7008 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1)), p2:(GEQ s0 1), p1:(OR (AND (GEQ s5 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-11 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 3514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Graph (complete) has 5012 edges and 3514 vertex of which 3012 are kept as prefixes of interest. Removing 502 places using SCC suffix rule.10 ms
Discarding 502 places :
Also discarding 1000 output transitions
Drop transitions removed 1000 transitions
Discarding 2996 places :
Symmetric choice reduction at 0 with 2996 rule applications. Total rules 2997 place count 16 transition count 3012
Iterating global reduction 0 with 2996 rules applied. Total rules applied 5993 place count 16 transition count 3012
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 8989 place count 16 transition count 16
Applied a total of 8989 rules in 108 ms. Remains 16 /3514 variables (removed 3498) and now considering 16/7008 (removed 6992) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-12 11:45:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:04] [INFO ] Implicit Places using invariants in 25 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/3514 places, 16/7008 transitions.
Graph (complete) has 13 edges and 15 vertex of which 14 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 3 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-12 11:45:04] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:45:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-12 11:45:04] [INFO ] Invariant cache hit.
[2023-03-12 11:45:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/3514 places, 15/7008 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 14/3514 places, 15/7008 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s13 1)), p1:(AND (GEQ s2 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-12 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 3514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3514/3514 places, 7008/7008 transitions.
Graph (complete) has 5012 edges and 3514 vertex of which 2011 are kept as prefixes of interest. Removing 1503 places using SCC suffix rule.5 ms
Discarding 1503 places :
Also discarding 2000 output transitions
Drop transitions removed 2000 transitions
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 1000 place count 2011 transition count 4009
Discarding 1998 places :
Symmetric choice reduction at 1 with 1998 rule applications. Total rules 2998 place count 13 transition count 2011
Iterating global reduction 1 with 1998 rules applied. Total rules applied 4996 place count 13 transition count 2011
Ensure Unique test removed 1998 transitions
Reduce isomorphic transitions removed 1998 transitions.
Iterating post reduction 1 with 1998 rules applied. Total rules applied 6994 place count 13 transition count 13
Applied a total of 6994 rules in 142 ms. Remains 13 /3514 variables (removed 3501) and now considering 13/7008 (removed 6995) transitions.
// Phase 1: matrix 13 rows 13 cols
[2023-03-12 11:45:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 11:45:05] [INFO ] Invariant cache hit.
[2023-03-12 11:45:05] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-12 11:45:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:45:05] [INFO ] Invariant cache hit.
[2023-03-12 11:45:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/3514 places, 13/7008 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 13/3514 places, 13/7008 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s12 1)) (GEQ s0 1)), p1:(OR (LT s3 1) (LT s10 1))], nbAcceptance=2, 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 14816 reset in 112 ms.
Product exploration explored 100000 steps with 14820 reset in 119 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 13
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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 580 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-14 finished in 1239 ms.
All properties solved by simple procedures.
Total runtime 55932 ms.
ITS solved all properties within timeout

BK_STOP 1678621506971

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AirplaneLD-PT-1000, 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 r009-oct2-167813597700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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