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.r169-tall-167838855700292.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 ltsminxred
Input is FMS-PT-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.0K Feb 25 19:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 19:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 19:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 19:42 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 24K 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 11K Feb 25 19:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 19:45 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-50000-LTLFireability-00
FORMULA_NAME FMS-PT-50000-LTLFireability-01
FORMULA_NAME FMS-PT-50000-LTLFireability-02
FORMULA_NAME FMS-PT-50000-LTLFireability-03
FORMULA_NAME FMS-PT-50000-LTLFireability-04
FORMULA_NAME FMS-PT-50000-LTLFireability-05
FORMULA_NAME FMS-PT-50000-LTLFireability-06
FORMULA_NAME FMS-PT-50000-LTLFireability-07
FORMULA_NAME FMS-PT-50000-LTLFireability-08
FORMULA_NAME FMS-PT-50000-LTLFireability-09
FORMULA_NAME FMS-PT-50000-LTLFireability-10
FORMULA_NAME FMS-PT-50000-LTLFireability-11
FORMULA_NAME FMS-PT-50000-LTLFireability-12
FORMULA_NAME FMS-PT-50000-LTLFireability-13
FORMULA_NAME FMS-PT-50000-LTLFireability-14
FORMULA_NAME FMS-PT-50000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678503588107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-50000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 02:59:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:59:49] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 02:59:49] [INFO ] Transformed 22 places.
[2023-03-11 02:59:49] [INFO ] Transformed 20 transitions.
[2023-03-11 02:59:49] [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 4 formulas.
FORMULA FMS-PT-50000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-50000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 9 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:59:50] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-11 02:59:50] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-11 02:59:50] [INFO ] Invariant cache hit.
[2023-03-11 02:59:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-11 02:59:50] [INFO ] Invariant cache hit.
[2023-03-11 02:59:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 19 out of 22 places after structural reductions.
[2023-03-11 02:59:50] [INFO ] Flatten gal took : 15 ms
[2023-03-11 02:59:50] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:59:50] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=1315 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 02:59:50] [INFO ] Invariant cache hit.
[2023-03-11 02:59:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:50] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:59:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:50] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:59:50] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 02:59:50] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 150393 steps, including 0 resets, run visited all 3 properties in 1338 ms. (steps per millisecond=112 )
Parikh walk visited 3 properties in 1339 ms.
FORMULA FMS-PT-50000-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((X(F(p0))||G(p1)))'
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-11 02:59:52] [INFO ] Invariant cache hit.
[2023-03-11 02:59:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 02:59:52] [INFO ] Invariant cache hit.
[2023-03-11 02:59:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-11 02:59:52] [INFO ] Invariant cache hit.
[2023-03-11 02:59:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(OR (GEQ s9 1) (GEQ s20 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 20078 reset in 251 ms.
Product exploration explored 100000 steps with 20056 reset in 145 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 283 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=3125 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:59:53] [INFO ] Invariant cache hit.
[2023-03-11 02:59:53] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-11 02:59:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-11 02:59:53] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:53] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 02:59:53] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 199891 steps, including 0 resets, run visited all 1 properties in 235 ms. (steps per millisecond=850 )
Parikh walk visited 1 properties in 235 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 360 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=4166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:54] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 02:59:54] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 201264 steps, including 0 resets, run visited all 1 properties in 189 ms. (steps per millisecond=1064 )
Parikh walk visited 1 properties in 189 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19939 reset in 95 ms.
Product exploration explored 100000 steps with 19863 reset in 89 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 21 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 21 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 13 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2023-03-11 02:59:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2023-03-11 02:59:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:59:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 22/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 21/22 places, 22/20 transitions.
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.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:59:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 22/22 places, 20/20 transitions.
Treatment of property FMS-PT-50000-LTLFireability-02 finished in 4054 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(p0)||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 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s14 1), p1:(OR (LT s5 1) (LT s7 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][false, false, false, false]]
Product exploration explored 100000 steps with 1152 reset in 118 ms.
Stack based approach found an accepted trace after 169 steps with 1 reset with depth 117 and stack size 117 in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-03 finished in 403 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&&(X(p1)||F(p2))))))'
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-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-11 02:59:56] [INFO ] Invariant cache hit.
[2023-03-11 02:59:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s11 1), p2:(LT s19 1), p1:(OR (AND (GEQ s19 1) (GEQ s0 1)) (GEQ s0 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 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-04 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U p1) U X(p2)))))'
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-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Dead Transitions using invariants and state equation in 23 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 328 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s2 1) (GEQ s18 1)), p2:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-05 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
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-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s1 1) (AND (GEQ s8 1) (GEQ s10 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 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-06 finished in 223 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((p0||X((G(p1) U (p0&&G(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-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 02:59:57] [INFO ] Invariant cache hit.
[2023-03-11 02:59:57] [INFO ] Dead Transitions using invariants and state equation in 24 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 188 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1)), p0:(LT s6 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]]
Entered a terminal (fully accepting) state of product in 24 steps with 7 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-07 finished in 288 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 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 9 / 15 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 8 transition count 7
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 25 place count 5 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 5 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 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-11 02:59:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2023-03-11 02:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Dead Transitions using invariants and state equation in 17 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 57 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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-50000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-09 finished in 107 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 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 7 places and 0 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
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 24 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
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 7 transition count 6
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 28 place count 5 transition count 6
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 30 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 4 transition count 4
Applied a total of 31 rules in 8 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 02:59:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-11 02:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 4/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 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-50000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-10 finished in 122 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(G(p1))&&p0))||G(F(p2)))))'
Support contains 4 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 17 vertex of which 6 / 17 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 7 rules applied. Total rules applied 10 place count 13 transition count 16
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 17 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 10 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 10 transition count 9
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 21 place count 9 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 9 transition count 9
Applied a total of 22 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 02:59:58] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 16 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 9/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23 ms. Remains : 8/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p2:(GEQ s3 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-11 finished in 120 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((G(p0)||(p0&&F(p1))))))'
Support contains 2 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 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 8 rules applied. Total rules applied 12 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 13 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 15 place count 13 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 19 place count 11 transition count 11
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 3 with 3 rules applied. Total rules applied 22 place count 9 transition count 10
Applied a total of 22 rules in 8 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 02:59:58] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-11 02:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s7 1), p0:(LT s3 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-50000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-14 finished in 192 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
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 23 place count 9 transition count 9
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 26 place count 7 transition count 8
Applied a total of 26 rules in 11 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 02:59:58] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-11 02:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:59:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : FMS-PT-50000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 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-50000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-15 finished in 125 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))||G(p1)))'
Found a Shortening insensitive property : FMS-PT-50000-LTLFireability-02
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 20/20 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 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 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 7 rules applied. Total rules applied 11 place count 16 transition count 15
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 14 place count 15 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 13 transition count 12
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 18 place count 12 transition count 12
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 22 place count 10 transition count 10
Applied a total of 22 rules in 4 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-11 02:59:58] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 02:59:58] [INFO ] Invariant cache hit.
[2023-03-11 02:59:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72 ms. Remains : 10/22 places, 10/20 transitions.
Running random walk in product with property : FMS-PT-50000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(OR (GEQ s5 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17280 reset in 72 ms.
Product exploration explored 100000 steps with 17337 reset in 76 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=3571 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:59:59] [INFO ] Invariant cache hit.
[2023-03-11 02:59:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:59] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:59] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:59] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 02:59:59] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 225065 steps, including 0 resets, run visited all 1 properties in 189 ms. (steps per millisecond=1190 )
Parikh walk visited 1 properties in 189 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 318 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 10/10 places, 10/10 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=5555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 03:00:00] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:00:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 03:00:00] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:00:00] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:00:00] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 225225 steps, including 0 resets, run visited all 1 properties in 174 ms. (steps per millisecond=1294 )
Parikh walk visited 1 properties in 174 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17480 reset in 70 ms.
Product exploration explored 100000 steps with 17348 reset in 88 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-11 03:00:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:00:01] [INFO ] Invariant cache hit.
[2023-03-11 03:00:01] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27 ms. Remains : 10/10 places, 10/10 transitions.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-11 03:00:01] [INFO ] Invariant cache hit.
[2023-03-11 03:00:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 03:00:01] [INFO ] Invariant cache hit.
[2023-03-11 03:00:01] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 03:00:01] [INFO ] Invariant cache hit.
[2023-03-11 03:00:01] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 10/10 places, 10/10 transitions.
Treatment of property FMS-PT-50000-LTLFireability-02 finished in 3251 ms.
[2023-03-11 03:00:02] [INFO ] Flatten gal took : 2 ms
[2023-03-11 03:00:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:00:02] [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 12391 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1312/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FMS-PT-50000-LTLFireability-02

BK_STOP 1678503603230

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
ltl formula name FMS-PT-50000-LTLFireability-02
ltl formula formula --ltl=/tmp/1312/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 22 places, 20 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FMS-PT-50000, 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 r169-tall-167838855700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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