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-167813595200268.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-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595200268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 37K Feb 26 11:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 11:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 55K Feb 26 11:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 325K Feb 26 11:12 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 39K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 200K Feb 26 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 806K Feb 26 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 89K Feb 26 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 542K Feb 26 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 433K 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-0100-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678345231750

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-0100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:00:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 07:00:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:00:34] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-09 07:00:34] [INFO ] Transformed 719 places.
[2023-03-09 07:00:34] [INFO ] Transformed 808 transitions.
[2023-03-09 07:00:34] [INFO ] Parsed PT model containing 719 places and 808 transitions and 3078 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 302 places and 0 transitions.
FORMULA AirplaneLD-PT-0100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 313 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 808
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 101 place count 316 transition count 710
Iterating global reduction 1 with 98 rules applied. Total rules applied 199 place count 316 transition count 710
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 297 place count 316 transition count 612
Applied a total of 297 rules in 28 ms. Remains 316 /417 variables (removed 101) and now considering 612/808 (removed 196) transitions.
// Phase 1: matrix 612 rows 316 cols
[2023-03-09 07:00:35] [INFO ] Computed 1 place invariants in 43 ms
[2023-03-09 07:00:35] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-09 07:00:35] [INFO ] Invariant cache hit.
[2023-03-09 07:00:35] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-09 07:00:35] [INFO ] Invariant cache hit.
[2023-03-09 07:00:36] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 316/417 places, 612/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 316/417 places, 612/808 transitions.
Support contains 313 out of 316 places after structural reductions.
[2023-03-09 07:00:36] [INFO ] Flatten gal took : 71 ms
[2023-03-09 07:00:36] [INFO ] Flatten gal took : 41 ms
[2023-03-09 07:00:36] [INFO ] Input system was already deterministic with 612 transitions.
Incomplete random walk after 10000 steps, including 1236 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 07:00:37] [INFO ] Invariant cache hit.
[2023-03-09 07:00:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 07:00:38] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-0100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 316 stabilizing places and 612 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 316 transition count 612
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(((G(p1)&&p0)||(p2&&F(p1)))))'
Support contains 53 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 68 transition count 364
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 68 transition count 364
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 68 transition count 116
Applied a total of 744 rules in 21 ms. Remains 68 /316 variables (removed 248) and now considering 116/612 (removed 496) transitions.
// Phase 1: matrix 116 rows 68 cols
[2023-03-09 07:00:38] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 07:00:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 07:00:38] [INFO ] Invariant cache hit.
[2023-03-09 07:00:38] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-09 07:00:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 07:00:38] [INFO ] Invariant cache hit.
[2023-03-09 07:00:38] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/316 places, 116/612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 68/316 places, 116/612 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s66 1)), p2:(OR (AND (GEQ s12 1) (GEQ s37 1)) (AND (GEQ s12 1) (GEQ s39 1)) (AND (GEQ s12 1) (GEQ s41 1)) (AND (GEQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 4 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-01 finished in 690 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(p0)||((F(X(F(p1))) U p2)&&F(p2))))'
Support contains 103 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 118 transition count 414
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 118 transition count 414
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 594 place count 118 transition count 216
Applied a total of 594 rules in 20 ms. Remains 118 /316 variables (removed 198) and now considering 216/612 (removed 396) transitions.
// Phase 1: matrix 216 rows 118 cols
[2023-03-09 07:00:39] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-09 07:00:39] [INFO ] Implicit Places using invariants in 51 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/316 places, 216/612 transitions.
Graph (complete) has 115 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 116 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 115 transition count 214
Applied a total of 3 rules in 10 ms. Remains 115 /117 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 115 cols
[2023-03-09 07:00:39] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-09 07:00:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 07:00:39] [INFO ] Invariant cache hit.
[2023-03-09 07:00:39] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/316 places, 214/612 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 115/316 places, 214/612 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s113 1), p2:(OR (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s27 1)) (AND (GEQ s6 1) (GEQ s29 1)) (AND (GEQ s6 1) (GEQ s31 1)) (AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3760 steps with 547 reset in 142 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-03 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 104 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 119 transition count 415
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 119 transition count 415
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 591 place count 119 transition count 218
Applied a total of 591 rules in 9 ms. Remains 119 /316 variables (removed 197) and now considering 218/612 (removed 394) transitions.
// Phase 1: matrix 218 rows 119 cols
[2023-03-09 07:00:40] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-09 07:00:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 07:00:40] [INFO ] Invariant cache hit.
[2023-03-09 07:00:40] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-09 07:00:40] [INFO ] Invariant cache hit.
[2023-03-09 07:00:40] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/316 places, 218/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 119/316 places, 218/612 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s2 1)), p1:(OR (AND (GEQ s6 1) (GEQ s38 1)) (AND (GEQ s6 1) (GEQ s103 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s6 1) (GEQ s99 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 480 steps with 239 reset in 12 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-05 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(((G(!p2)&&X(!p3))||p1))))'
Support contains 105 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 118 transition count 414
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 118 transition count 414
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 594 place count 118 transition count 216
Applied a total of 594 rules in 8 ms. Remains 118 /316 variables (removed 198) and now considering 216/612 (removed 396) transitions.
// Phase 1: matrix 216 rows 118 cols
[2023-03-09 07:00:40] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-09 07:00:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 07:00:40] [INFO ] Invariant cache hit.
[2023-03-09 07:00:40] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-09 07:00:41] [INFO ] Invariant cache hit.
[2023-03-09 07:00:41] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/316 places, 216/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 118/316 places, 216/612 transitions.
Stuttering acceptance computed with spot in 409 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (OR (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (OR p2 p3), (OR p2 (AND (NOT p1) p3)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(OR p2 p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (OR (LT s9 1) (LT s12 1)) (OR (LT s9 1) (LT s10 1)) (OR (LT s9 1) (LT s20 1)) (OR (LT s9 1) (LT s18 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s9 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 579 ms.
Product exploration explored 100000 steps with 50000 reset in 648 ms.
Computed a total of 118 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 216
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 p2 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p3)))), true, (F (G p0)), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (OR p2 p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 13 factoid took 1007 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-06 finished in 3384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(!p1))))'
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 297 place count 19 transition count 315
Iterating global reduction 0 with 297 rules applied. Total rules applied 594 place count 19 transition count 315
Ensure Unique test removed 297 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 0 with 297 rules applied. Total rules applied 891 place count 19 transition count 18
Applied a total of 891 rules in 5 ms. Remains 19 /316 variables (removed 297) and now considering 18/612 (removed 594) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:00:44] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 07:00:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 07:00:44] [INFO ] Invariant cache hit.
[2023-03-09 07:00:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-09 07:00:44] [INFO ] Invariant cache hit.
[2023-03-09 07:00:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/316 places, 18/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 19/316 places, 18/612 transitions.
Stuttering acceptance computed with spot in 298 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-08 finished in 477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 295 places :
Symmetric choice reduction at 0 with 295 rule applications. Total rules 295 place count 21 transition count 317
Iterating global reduction 0 with 295 rules applied. Total rules applied 590 place count 21 transition count 317
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 295 transitions.
Iterating post reduction 0 with 295 rules applied. Total rules applied 885 place count 21 transition count 22
Applied a total of 885 rules in 12 ms. Remains 21 /316 variables (removed 295) and now considering 22/612 (removed 590) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:00:44] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 07:00:44] [INFO ] Implicit Places using invariants in 54 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/316 places, 22/612 transitions.
Applied a total of 0 rules in 1 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 69 ms. Remains : 20/316 places, 22/612 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s9 1) (GEQ s12 1))) (NOT (AND (GEQ s5 1) (GEQ s8 1)))), p0:(GEQ s19 1), p1:(AND (GEQ s5 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 86 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 p0 (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-10 finished in 814 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 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Graph (complete) has 464 edges and 316 vertex of which 214 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.3 ms
Discarding 102 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 16 transition count 214
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 16 transition count 214
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 16 transition count 16
Applied a total of 595 rules in 17 ms. Remains 16 /316 variables (removed 300) and now considering 16/612 (removed 596) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-09 07:00:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:00:45] [INFO ] Implicit Places using invariants in 47 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/316 places, 16/612 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.2 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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 4 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2023-03-09 07:00:45] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 07:00:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 07:00:45] [INFO ] Invariant cache hit.
[2023-03-09 07:00:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/316 places, 14/612 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 13/316 places, 14/612 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-11 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 s6 1) (GEQ s8 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 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-11 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p1)))))'
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 20 transition count 316
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 20 transition count 316
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 20 transition count 20
Applied a total of 888 rules in 9 ms. Remains 20 /316 variables (removed 296) and now considering 20/612 (removed 592) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 07:00:45] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 07:00:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 07:00:45] [INFO ] Invariant cache hit.
[2023-03-09 07:00:45] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-09 07:00:45] [INFO ] Invariant cache hit.
[2023-03-09 07:00:45] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/316 places, 20/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 20/316 places, 20/612 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-13 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 20 transition count 316
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 20 transition count 316
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 20 transition count 20
Applied a total of 888 rules in 28 ms. Remains 20 /316 variables (removed 296) and now considering 20/612 (removed 592) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 07:00:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants in 42 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 SI_LTL mode, iteration 1 : 19/316 places, 20/612 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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 11 ms. Remains 18 /19 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 18 cols
[2023-03-09 07:00:46] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 07:00:46] [INFO ] Invariant cache hit.
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/316 places, 19/612 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 18/316 places, 19/612 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1)), p1:(AND (OR (LT s1 1) (LT s2 1) (AND (GEQ s1 1) (GEQ s2 1))) (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, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-14 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&(G(F((!p1 U (G(!p1)||(!p1&&G(!p2))))))||(F((!p1 U (G(!p1)||(!p1&&G(!p2)))))&&G(F(p0)))))))'
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 612/612 transitions.
Graph (complete) has 464 edges and 316 vertex of which 215 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.3 ms
Discarding 101 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 215 transition count 413
Discarding 198 places :
Symmetric choice reduction at 1 with 198 rule applications. Total rules 298 place count 17 transition count 215
Iterating global reduction 1 with 198 rules applied. Total rules applied 496 place count 17 transition count 215
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 694 place count 17 transition count 17
Applied a total of 694 rules in 19 ms. Remains 17 /316 variables (removed 299) and now considering 17/612 (removed 595) transitions.
// Phase 1: matrix 17 rows 17 cols
[2023-03-09 07:00:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/316 places, 17/612 transitions.
Graph (complete) has 13 edges and 16 vertex of which 15 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 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-09 07:00:46] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 07:00:46] [INFO ] Invariant cache hit.
[2023-03-09 07:00:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/316 places, 16/612 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 15/316 places, 16/612 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR p1 p0), (AND p2 p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s13 1), p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 13582 reset in 158 ms.
Product exploration explored 100000 steps with 13532 reset in 130 ms.
Computed a total of 15 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 16
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 (NOT p2) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 19 factoid took 1321 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-15 finished in 2280 ms.
All properties solved by simple procedures.
Total runtime 14554 ms.
ITS solved all properties within timeout

BK_STOP 1678345249702

--------------------
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-0100"
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-0100, 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-167813595200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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