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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 12K Feb 26 11:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 11:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 11:09 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 6.2K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 11:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 11:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 48K 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-0010-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678344977483

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:56:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 06:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:56:19] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-09 06:56:19] [INFO ] Transformed 89 places.
[2023-03-09 06:56:19] [INFO ] Transformed 88 transitions.
[2023-03-09 06:56:19] [INFO ] Parsed PT model containing 89 places and 88 transitions and 333 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 32 places and 0 transitions.
FORMULA AirplaneLD-PT-0010-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 57 cols
[2023-03-09 06:56:19] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-09 06:56:20] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-09 06:56:20] [INFO ] Invariant cache hit.
[2023-03-09 06:56:20] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-09 06:56:20] [INFO ] Invariant cache hit.
[2023-03-09 06:56:20] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 57/57 places, 88/88 transitions.
Support contains 56 out of 57 places after structural reductions.
[2023-03-09 06:56:20] [INFO ] Flatten gal took : 28 ms
[2023-03-09 06:56:20] [INFO ] Flatten gal took : 13 ms
[2023-03-09 06:56:20] [INFO ] Input system was already deterministic with 88 transitions.
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 26) seen :17
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 06:56:21] [INFO ] Invariant cache hit.
[2023-03-09 06:56:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 06:56:21] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 06:56:21] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AirplaneLD-PT-0010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 57 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 88
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' '!((G(p0) U p1))'
Support contains 14 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Graph (complete) has 128 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 30 transition count 62
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 30 transition count 62
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 79 place count 30 transition count 36
Applied a total of 79 rules in 10 ms. Remains 30 /57 variables (removed 27) and now considering 36/88 (removed 52) transitions.
// Phase 1: matrix 36 rows 30 cols
[2023-03-09 06:56:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 06:56:21] [INFO ] Implicit Places using invariants in 41 ms returned [29]
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 : 29/57 places, 36/88 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 1 place count 29 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 35
Applied a total of 2 rules in 20 ms. Remains 28 /29 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 28 cols
[2023-03-09 06:56:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:56:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-09 06:56:21] [INFO ] Invariant cache hit.
[2023-03-09 06:56:21] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/57 places, 35/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 28/57 places, 35/88 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s14 s26), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s23 s24))], 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]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 4 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-03 finished in 622 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((G(p0)||(F(!p0)&&X(p1)))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 88
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 20 transition count 53
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 20 transition count 53
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 107 place count 20 transition count 18
Applied a total of 107 rules in 4 ms. Remains 20 /57 variables (removed 37) and now considering 18/88 (removed 70) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 06:56:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 06:56:22] [INFO ] Implicit Places using invariants in 51 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/57 places, 18/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 19/57 places, 18/88 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s15 (ADD s12 s13)), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-04 finished in 370 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(G(p1)))))'
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Graph (complete) has 128 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 28 transition count 62
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 28 transition count 62
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 79 place count 28 transition count 36
Applied a total of 79 rules in 8 ms. Remains 28 /57 variables (removed 29) and now considering 36/88 (removed 52) transitions.
// Phase 1: matrix 36 rows 28 cols
[2023-03-09 06:56:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:56:22] [INFO ] Implicit Places using invariants in 53 ms returned [27]
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 : 27/57 places, 36/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 27/57 places, 36/88 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13)), p1:(GT (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13) (ADD s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-05 finished in 267 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(((p1||G(p2))&&p0))))'
Support contains 33 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Graph (complete) has 128 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 48 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 48 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 25 place count 48 transition count 72
Applied a total of 25 rules in 17 ms. Remains 48 /57 variables (removed 9) and now considering 72/88 (removed 16) transitions.
// Phase 1: matrix 72 rows 48 cols
[2023-03-09 06:56:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 06:56:22] [INFO ] Implicit Places using invariants in 47 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/57 places, 72/88 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 1 place count 47 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 71
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 46 cols
[2023-03-09 06:56:22] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 06:56:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 06:56:22] [INFO ] Invariant cache hit.
[2023-03-09 06:56:22] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/57 places, 71/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 46/57 places, 71/88 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 (ADD s41 s42)), p0:(AND (GT 1 (ADD s41 s42)) (GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-06 finished in 258 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 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 88
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 36 place count 21 transition count 54
Iterating global reduction 1 with 34 rules applied. Total rules applied 70 place count 21 transition count 54
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 104 place count 21 transition count 20
Applied a total of 104 rules in 1 ms. Remains 21 /57 variables (removed 36) and now considering 20/88 (removed 68) transitions.
// Phase 1: matrix 20 rows 21 cols
[2023-03-09 06:56:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 06:56:23] [INFO ] Implicit Places using invariants in 25 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/57 places, 20/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 20/57 places, 20/88 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s16 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0010-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0010-LTLCardinality-08 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X(p0)))))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 88
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 20 transition count 54
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 20 transition count 54
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 105 place count 20 transition count 20
Applied a total of 105 rules in 31 ms. Remains 20 /57 variables (removed 37) and now considering 20/88 (removed 68) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 06:56:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:56:23] [INFO ] Implicit Places using invariants in 55 ms returned [19]
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 : 19/57 places, 20/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 19/57 places, 20/88 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT s2 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-10 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 88
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 20 transition count 54
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 20 transition count 54
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 105 place count 20 transition count 20
Applied a total of 105 rules in 6 ms. Remains 20 /57 variables (removed 37) and now considering 20/88 (removed 68) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-09 06:56:24] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 06:56:24] [INFO ] Implicit Places using invariants in 342 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/57 places, 20/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 19/57 places, 20/88 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s15 s7), p0:(LEQ s3 s5)], 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 23106 reset in 168 ms.
Product exploration explored 100000 steps with 23095 reset in 146 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
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) p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 247 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-0010-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0010-LTLCardinality-12 finished in 1149 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(p0)&&F(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Graph (complete) has 128 edges and 57 vertex of which 42 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 15 transition count 41
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 15 transition count 41
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 82 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 82 place count 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 14 transition count 13
Applied a total of 84 rules in 12 ms. Remains 14 /57 variables (removed 43) and now considering 13/88 (removed 75) transitions.
// Phase 1: matrix 13 rows 14 cols
[2023-03-09 06:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 06:56:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 06:56:25] [INFO ] Invariant cache hit.
[2023-03-09 06:56:25] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/57 places, 13/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 13/57 places, 13/88 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ 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={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s12 s6), p1:(GT s6 s9)], 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]]
Product exploration explored 100000 steps with 33365 reset in 132 ms.
Product exploration explored 100000 steps with 33330 reset in 111 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 570 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 543 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
// Phase 1: matrix 13 rows 13 cols
[2023-03-09 06:56:27] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-09 06:56:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 06:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:56:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 06:56:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:56:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 06:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:56:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 06:56:27] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 06:56:27] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-09 06:56:27] [INFO ] Invariant cache hit.
[2023-03-09 06:56:27] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 06:56:27] [INFO ] Invariant cache hit.
[2023-03-09 06:56:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-09 06:56:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:56:27] [INFO ] Invariant cache hit.
[2023-03-09 06:56:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 13/13 places, 13/13 transitions.
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 : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2023-03-09 06:56:28] [INFO ] Invariant cache hit.
[2023-03-09 06:56:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 06:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:56:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 06:56:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:56:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 06:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:56:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-09 06:56:28] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 06:56:28] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33358 reset in 201 ms.
Product exploration explored 100000 steps with 33410 reset in 78 ms.
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 13/13 transitions.
Graph (complete) has 12 edges and 13 vertex of which 4 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 3 transition count 2
Applied a total of 4 rules in 2 ms. Remains 3 /13 variables (removed 10) and now considering 2/13 (removed 11) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-09 06:56:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 06:56:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 06:56:28] [INFO ] Invariant cache hit.
[2023-03-09 06:56:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-09 06:56:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:56:28] [INFO ] Invariant cache hit.
[2023-03-09 06:56:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/13 places, 2/13 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 3/13 places, 2/13 transitions.
Treatment of property AirplaneLD-PT-0010-LTLCardinality-13 finished in 3801 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(p0)&&F(p1))))'
[2023-03-09 06:56:29] [INFO ] Flatten gal took : 17 ms
[2023-03-09 06:56:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-09 06:56:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 88 transitions and 245 arcs took 3 ms.
Total runtime 9627 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AirplaneLD-PT-0010
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA AirplaneLD-PT-0010-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678344990046

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 AirplaneLD-PT-0010-LTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AirplaneLD-PT-0010-LTLCardinality-13
lola: result : true
lola: markings : 24445
lola: fired transitions : 36664
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-0010-LTLCardinality-13: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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-0010"
export BK_EXAMINATION="LTLCardinality"
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-0010, examination is LTLCardinality"
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-167813595200243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0010.tgz
mv AirplaneLD-PT-0010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;