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-167838856500884.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 GPPP-PT-C1000N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500884
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 10:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678658717353

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=GPPP-PT-C1000N0000000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:05:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:05:19] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-12 22:05:19] [INFO ] Transformed 33 places.
[2023-03-12 22:05:19] [INFO ] Transformed 22 transitions.
[2023-03-12 22:05:19] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:19] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-12 22:05:19] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:05:19] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:19] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:05:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:19] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2023-03-12 22:05:19] [INFO ] Flatten gal took : 18 ms
[2023-03-12 22:05:19] [INFO ] Flatten gal took : 5 ms
[2023-03-12 22:05:19] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10005 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 20) seen :19
Finished Best-First random walk after 225 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
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(G((p0&&F((p1||X((!p2 U (p3||G(!p2))))))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:20] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:20] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:20] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:05:20] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:20] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 168 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-00 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 p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s22 1), p1:(GEQ s18 1), p3:(AND (GEQ s1 1) (GEQ s24 1) (NOT (AND (GEQ s2 1) (GEQ s21 1)))), p2:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-00 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(!p0 U p1)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 19
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 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Applied a total of 9 rules in 15 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 17
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 24 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/33 places, 17/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 24/33 places, 17/22 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-01 finished in 452 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 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 12 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [0, 2, 3, 15, 19]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 94 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 18 transition count 14
Applied a total of 6 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:21] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s5 1) (LT s16 7000))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 519 reset in 225 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 25 in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-02 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s27 2000)), p0:(AND (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-03 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((!p1&&F(!p0)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 11 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:05:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 2, 15, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 101 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 16
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 21/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), p0, (OR p1 p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s11 1), p1:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-04 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-04 finished in 368 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||G(p1)))||F((p2||X(X(p0))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:22] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 92 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s8 1) (GEQ s9 1)), p0:(GEQ s11 1), p1:(AND (GEQ s2 1) (GEQ s21 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 8898 reset in 196 ms.
Product exploration explored 100000 steps with 8922 reset in 185 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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 355 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:05:24] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:24] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-12 22:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:24] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 22:05:24] [INFO ] Computed and/alt/rep : 21/43/21 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 22:05:24] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 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 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 29 transition count 20
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 2 with 5 rules applied. Total rules applied 9 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 transition count 17
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 2 with 2 rules applied. Total rules applied 14 place count 23 transition count 16
Applied a total of 14 rules in 4 ms. Remains 23 /31 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:05:24] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:05:24] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:24] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:05:24] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 16/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 21/31 places, 16/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-12 22:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:25] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-12 22:05:25] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 22:05:25] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10739 reset in 102 ms.
Product exploration explored 100000 steps with 10794 reset in 78 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 15
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 0 with 2 rules applied. Total rules applied 5 place count 18 transition count 14
Applied a total of 5 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:25] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-12 22:05:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 18/21 places, 14/16 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-05 finished in 2979 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 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-12 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:25] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:25] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-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:(AND (GEQ s3 1) (GEQ s4 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 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-06 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 95 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-07 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 115 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s15 1), p2:(AND (NOT (AND (GEQ s2 1) (GEQ s21 1))) (GEQ s22 1)), p1:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-08 finished in 361 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(((X(X(p0))&&F(!p1))||G(p0))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:26] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 98 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s26 2000)), p0:(AND (GEQ s6 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6601 reset in 105 ms.
Stack based approach found an accepted trace after 46 steps with 3 reset with depth 12 and stack size 12 in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-09 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&X(X(p1))&&F((p2||X(p0)))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:27] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 148 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p1:(GEQ s11 1), p2:(GEQ s18 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-11 finished in 458 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(F((p0&&X(F(!p1))))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:27] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:27] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p0) p1), p1]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 2), p1:(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][false, false, false]]
Product exploration explored 100000 steps with 1699 reset in 176 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-12 finished in 473 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 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 8 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 16/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/33 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 22/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s11 1) (LT s3 1) (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 28 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-13 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1 U p2))||X(X(G(!p3)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:28] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 504 ms :[true, (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), (AND (NOT p2) p3), (AND (NOT p2) p3), (NOT p2), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), p3]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=p3, acceptance={} source=10 dest: 0}, { cond=(NOT p3), acceptance={} source=10 dest: 10}]], initial=8, aps=[p0:(GEQ s18 1), p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1)), p1:(GEQ s19 1), p3:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-14 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
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 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 5 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:28] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [0, 2, 3, 14, 18]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 83 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 16/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 13
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 17 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 13/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 17/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s5 1)), p0:(LT s8 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, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-15 finished in 248 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||G(p1)))||F((p2||X(X(p0))))))'
Found a Shortening insensitive property : GPPP-PT-C1000N0000000010-LTLFireability-05
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 8 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [0, 2, 15, 19]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 88 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/33 places, 17/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 16
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:29] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 200 ms. Remains : 21/33 places, 16/22 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s6 1), p1:(AND (GEQ s1 1) (GEQ s13 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10777 reset in 137 ms.
Product exploration explored 100000 steps with 10722 reset in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 546 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 22:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-12 22:05:31] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 22:05:31] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:31] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-12 22:05:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:05:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 21/21 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 51 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-12 22:05:31] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 22:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:05:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-12 22:05:31] [INFO ] Computed and/alt/rep : 15/36/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 22:05:31] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10766 reset in 82 ms.
Product exploration explored 100000 steps with 10774 reset in 96 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 15
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 0 with 2 rules applied. Total rules applied 5 place count 18 transition count 14
Applied a total of 5 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:32] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:32] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:32] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:32] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-12 22:05:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2023-03-12 22:05:32] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:05:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 18/21 places, 14/16 transitions.
Treatment of property GPPP-PT-C1000N0000000010-LTLFireability-05 finished in 3097 ms.
[2023-03-12 22:05:32] [INFO ] Flatten gal took : 3 ms
[2023-03-12 22:05:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 22:05:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 13177 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1340/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GPPP-PT-C1000N0000000010-LTLFireability-05

BK_STOP 1678658733724

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
ltl formula name GPPP-PT-C1000N0000000010-LTLFireability-05
ltl formula formula --ltl=/tmp/1340/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 33 places, 22 transitions and 83 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1340/ltl_0_
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/1340/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1340/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1340/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 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="GPPP-PT-C1000N0000000010"
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 GPPP-PT-C1000N0000000010, 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-167838856500884"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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