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-167838852800244.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 FMS-PT-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852800244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 20:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 20:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00500-LTLFireability-00
FORMULA_NAME FMS-PT-00500-LTLFireability-01
FORMULA_NAME FMS-PT-00500-LTLFireability-02
FORMULA_NAME FMS-PT-00500-LTLFireability-03
FORMULA_NAME FMS-PT-00500-LTLFireability-04
FORMULA_NAME FMS-PT-00500-LTLFireability-05
FORMULA_NAME FMS-PT-00500-LTLFireability-06
FORMULA_NAME FMS-PT-00500-LTLFireability-07
FORMULA_NAME FMS-PT-00500-LTLFireability-08
FORMULA_NAME FMS-PT-00500-LTLFireability-09
FORMULA_NAME FMS-PT-00500-LTLFireability-10
FORMULA_NAME FMS-PT-00500-LTLFireability-11
FORMULA_NAME FMS-PT-00500-LTLFireability-12
FORMULA_NAME FMS-PT-00500-LTLFireability-13
FORMULA_NAME FMS-PT-00500-LTLFireability-14
FORMULA_NAME FMS-PT-00500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678446816996

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:13:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 11:13:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:13:38] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-10 11:13:38] [INFO ] Transformed 22 places.
[2023-03-10 11:13:38] [INFO ] Transformed 20 transitions.
[2023-03-10 11:13:38] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FMS-PT-00500-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:38] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-10 11:13:38] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 11:13:38] [INFO ] Invariant cache hit.
[2023-03-10 11:13:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-10 11:13:38] [INFO ] Invariant cache hit.
[2023-03-10 11:13:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 16 out of 22 places after structural reductions.
[2023-03-10 11:13:39] [INFO ] Flatten gal took : 14 ms
[2023-03-10 11:13:39] [INFO ] Flatten gal took : 4 ms
[2023-03-10 11:13:39] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 9753 steps, including 2 resets, run visited all 15 properties in 38 ms. (steps per millisecond=256 )
Computed a total of 0 stabilizing places and 0 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' '!(G((p0||G((X(p0)||F((X(p2)&&p1)))))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:39] [INFO ] Invariant cache hit.
[2023-03-10 11:13:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 11:13:39] [INFO ] Invariant cache hit.
[2023-03-10 11:13:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 11:13:39] [INFO ] Invariant cache hit.
[2023-03-10 11:13:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(AND (OR (LT s8 1) (LT s10 1)) (LT s12 1)), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 250 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA FMS-PT-00500-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-00 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p2))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 8 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 17 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 17 transition count 14
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 12 place count 15 transition count 14
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 17 place count 12 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 17 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
[2023-03-10 11:13:40] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 12 cols
[2023-03-10 11:13:40] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 11:13:40] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 11:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:40] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (GEQ s1 1) (AND (GEQ s7 1) (GEQ s8 1) (GEQ s5 1))), p0:(GEQ s1 1), p1:(OR (GEQ s11 1) (GEQ s5 1))], nbAcceptance=0, 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 FMS-PT-00500-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-02 finished in 214 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))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s9 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 5886 reset in 129 ms.
Stack based approach found an accepted trace after 252 steps with 10 reset with depth 16 and stack size 16 in 1 ms.
FORMULA FMS-PT-00500-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-03 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 transition count 8
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 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 2 transition count 4
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 6 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-10 11:13:40] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 11:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:40] [INFO ] Invariant cache hit.
[2023-03-10 11:13:40] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-04 finished in 118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))||G(!p2)||X(p3)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:41] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 11:13:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 11:13:41] [INFO ] Invariant cache hit.
[2023-03-10 11:13:41] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 11:13:41] [INFO ] Invariant cache hit.
[2023-03-10 11:13:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) p2), (AND (NOT p0) (NOT p1) (NOT p3) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s0 1), p1:(GEQ s3 1), p3:(AND (GEQ s2 1) (GEQ s18 1)), p2:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5947 reset in 159 ms.
Product exploration explored 100000 steps with 5817 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Finished random walk after 2513 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=418 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:42] [INFO ] Invariant cache hit.
[2023-03-10 11:13:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 11:13:42] [INFO ] Invariant cache hit.
[2023-03-10 11:13:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-10 11:13:42] [INFO ] Invariant cache hit.
[2023-03-10 11:13:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Finished random walk after 1512 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=504 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Product exploration explored 100000 steps with 5864 reset in 155 ms.
Product exploration explored 100000 steps with 5803 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 22
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 22/20 (removed -2) transitions.
[2023-03-10 11:13:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 11:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 22/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 22/22 places, 22/20 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:44] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 22/22 places, 20/20 transitions.
Treatment of property FMS-PT-00500-LTLFireability-07 finished in 3213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { 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=2, aps=[p1:(GEQ s19 1), p0:(AND (GEQ s2 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-08 finished in 243 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) U G(!p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 132 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s19 1), p0:(GEQ s21 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 2317 reset in 95 ms.
Stack based approach found an accepted trace after 230 steps with 3 reset with depth 109 and stack size 109 in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-10 finished in 331 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(p1)&&p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 11:13:44] [INFO ] Invariant cache hit.
[2023-03-10 11:13:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1)), p0:(AND (GEQ s5 1) (GEQ s7 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-11 finished in 225 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&&(p1 U (!p2 U p3))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 19
Reduce places removed 2 places and 0 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 1 with 3 rules applied. Total rules applied 4 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 9 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 16 place count 13 transition count 13
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 19 place count 11 transition count 12
Applied a total of 19 rules in 4 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-03-10 11:13:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 11:13:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 11/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (NOT p0)), (NOT p3), (NOT p3)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND (NOT p2) p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p2 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(GEQ s10 1), p0:(LT s3 1), p2:(AND (GEQ s2 1) (GEQ s9 1)), p1:(GEQ 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 FMS-PT-00500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-12 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
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 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
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 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 7 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-10 11:13:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-10 11:13:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-13 finished in 106 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&&F(!p1)))||(!p0&&F(!p1)&&F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:13:45] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 11:13:45] [INFO ] Invariant cache hit.
[2023-03-10 11:13:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, p1, (NOT p1), (OR p0 p1), (OR p0 p1), (AND (NOT p1) p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s13 1) (GEQ s15 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1467 reset in 102 ms.
Stack based approach found an accepted trace after 255 steps with 5 reset with depth 19 and stack size 19 in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-15 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))||G(!p2)||X(p3)))'
[2023-03-10 11:13:46] [INFO ] Flatten gal took : 11 ms
[2023-03-10 11:13:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 11:13:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 7639 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FMS-PT-00500
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA FMS-PT-00500-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678446827039

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FMS-PT-00500-LTLFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for FMS-PT-00500-LTLFireability-07
lola: result : false
lola: markings : 4512
lola: fired transitions : 4512
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-00500-LTLFireability-07: LTL false LTL model checker


Time elapsed: 0 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="FMS-PT-00500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FMS-PT-00500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852800244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00500.tgz
mv FMS-PT-00500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;