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.r167-tall-167838853100475.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FlexibleBarrier-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:35 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 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 64K 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 FlexibleBarrier-PT-08a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678485460415

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=FlexibleBarrier-PT-08a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:57:42] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-10 21:57:42] [INFO ] Transformed 99 places.
[2023-03-10 21:57:42] [INFO ] Transformed 236 transitions.
[2023-03-10 21:57:42] [INFO ] Found NUPN structural information;
[2023-03-10 21:57:42] [INFO ] Parsed PT model containing 99 places and 236 transitions and 985 arcs in 114 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.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 17 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2023-03-10 21:57:42] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-10 21:57:42] [INFO ] Implicit Places using invariants in 502 ms returned [97, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 534 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/99 places, 178/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 97/99 places, 178/186 transitions.
Support contains 28 out of 97 places after structural reductions.
[2023-03-10 21:57:43] [INFO ] Flatten gal took : 34 ms
[2023-03-10 21:57:43] [INFO ] Flatten gal took : 14 ms
[2023-03-10 21:57:43] [INFO ] Input system was already deterministic with 178 transitions.
Finished random walk after 939 steps, including 0 resets, run visited all 18 properties in 63 ms. (steps per millisecond=14 )
Computed a total of 1 stabilizing places and 1 stable transitions
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 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 97 cols
[2023-03-10 21:57:43] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-10 21:57:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 21:57:43] [INFO ] Invariant cache hit.
[2023-03-10 21:57:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-10 21:57:43] [INFO ] Invariant cache hit.
[2023-03-10 21:57:43] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s89 1) (EQ s62 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-01 finished in 1238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p1))))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-10 21:57:44] [INFO ] Invariant cache hit.
[2023-03-10 21:57:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-10 21:57:44] [INFO ] Invariant cache hit.
[2023-03-10 21:57:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-10 21:57:44] [INFO ] Invariant cache hit.
[2023-03-10 21:57:44] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s71 0) (EQ s40 1)), p0:(OR (EQ s84 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29943 reset in 164 ms.
Stack based approach found an accepted trace after 1101 steps with 316 reset with depth 6 and stack size 6 in 2 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-02 finished in 588 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((X(p0)||F((p1&&X(p2)))))))'
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-10 21:57:45] [INFO ] Invariant cache hit.
[2023-03-10 21:57:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-10 21:57:45] [INFO ] Invariant cache hit.
[2023-03-10 21:57:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-10 21:57:45] [INFO ] Invariant cache hit.
[2023-03-10 21:57:45] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s49 0) (EQ s77 1)), p1:(OR (EQ s77 0) (EQ s49 1)), p2:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 480 reset in 255 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-03 finished in 660 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 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 125 edges and 97 vertex of which 92 / 97 are part of one of the 8 SCC in 6 ms
Free SCC test removed 84 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 4 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 44 place count 4 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 2 transition count 3
Applied a total of 50 rules in 18 ms. Remains 2 /97 variables (removed 95) and now considering 3/178 (removed 175) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-10 21:57:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-10 21:57:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/97 places, 3/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 2/97 places, 3/178 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-05 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:(EQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-05 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(p1))))'
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 120 edges and 97 vertex of which 86 / 97 are part of one of the 9 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 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 39 rules applied. Total rules applied 40 place count 13 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 11 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 43 place count 11 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 10 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 9 transition count 17
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 9 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 51 place count 9 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 7 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 6 transition count 8
Applied a total of 59 rules in 11 ms. Remains 6 /97 variables (removed 91) and now considering 8/178 (removed 170) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-03-10 21:57:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-10 21:57:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/97 places, 8/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 6/97 places, 8/178 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s4 1)), p1:(EQ s0 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-06 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(!p0)) U p1)))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 118 edges and 97 vertex of which 80 / 97 are part of one of the 10 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 22 transition count 36
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 19 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 17 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 17 transition count 33
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 16 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 15 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 15 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 15 transition count 29
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 48 place count 14 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 13 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 51 place count 12 transition count 27
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 65 place count 12 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 67 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 69 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 69 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 73 place count 8 transition count 9
Applied a total of 73 rules in 12 ms. Remains 8 /97 variables (removed 89) and now considering 9/178 (removed 169) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-03-10 21:57:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 21:57:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/97 places, 9/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 8/97 places, 9/178 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s6 1)), p0:(OR (EQ s4 0) (EQ 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 18 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-07 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 124 edges and 97 vertex of which 82 / 97 are part of one of the 10 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 18 transition count 27
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 14 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 12 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 12 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 12 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 69 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 6 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 6 transition count 13
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 79 place count 6 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 81 place count 6 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 83 place count 4 transition count 7
Applied a total of 83 rules in 9 ms. Remains 4 /97 variables (removed 93) and now considering 7/178 (removed 171) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-10 21:57:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 21:57:46] [INFO ] Redundant transitions in 21 ms returned [0, 1]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-10 21:57:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 21:57:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/97 places, 5/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 4/97 places, 5/178 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-08 finished in 147 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((X(p1)||p0)))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 97 cols
[2023-03-10 21:57:46] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-10 21:57:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 21:57:46] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s46 0) (EQ s31 1)), p1:(OR (EQ s58 0) (EQ s96 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 164 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-09 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-11 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s93 0) (NEQ s14 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-11 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U p1))))'
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s51 0) (EQ s40 1)), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-14 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:47] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 21:57:47] [INFO ] Invariant cache hit.
[2023-03-10 21:57:48] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-10 21:57:48] [INFO ] Invariant cache hit.
[2023-03-10 21:57:48] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-15 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s27 0) (EQ s80 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 192 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-15 finished in 294 ms.
All properties solved by simple procedures.
Total runtime 6079 ms.
ITS solved all properties within timeout

BK_STOP 1678485469118

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

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="FlexibleBarrier-PT-08a"
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 FlexibleBarrier-PT-08a, 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 r167-tall-167838853100475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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