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.r489-tall-167912706900564.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 TCPcondis-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706900564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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 TCPcondis-PT-50-LTLFireability-00
FORMULA_NAME TCPcondis-PT-50-LTLFireability-01
FORMULA_NAME TCPcondis-PT-50-LTLFireability-02
FORMULA_NAME TCPcondis-PT-50-LTLFireability-03
FORMULA_NAME TCPcondis-PT-50-LTLFireability-04
FORMULA_NAME TCPcondis-PT-50-LTLFireability-05
FORMULA_NAME TCPcondis-PT-50-LTLFireability-06
FORMULA_NAME TCPcondis-PT-50-LTLFireability-07
FORMULA_NAME TCPcondis-PT-50-LTLFireability-08
FORMULA_NAME TCPcondis-PT-50-LTLFireability-09
FORMULA_NAME TCPcondis-PT-50-LTLFireability-10
FORMULA_NAME TCPcondis-PT-50-LTLFireability-11
FORMULA_NAME TCPcondis-PT-50-LTLFireability-12
FORMULA_NAME TCPcondis-PT-50-LTLFireability-13
FORMULA_NAME TCPcondis-PT-50-LTLFireability-14
FORMULA_NAME TCPcondis-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679281592412

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=TCPcondis-PT-50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 03:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 03:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:06:34] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-20 03:06:34] [WARNING] Unknown XML tag in source file: size
[2023-03-20 03:06:34] [WARNING] Unknown XML tag in source file: color
[2023-03-20 03:06:34] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-20 03:06:34] [INFO ] Transformed 30 places.
[2023-03-20 03:06:34] [INFO ] Transformed 32 transitions.
[2023-03-20 03:06:34] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 90 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 TCPcondis-PT-50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:34] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-20 03:06:34] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-20 03:06:34] [INFO ] Invariant cache hit.
[2023-03-20 03:06:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-20 03:06:34] [INFO ] Invariant cache hit.
[2023-03-20 03:06:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 26 out of 30 places after structural reductions.
[2023-03-20 03:06:34] [INFO ] Flatten gal took : 21 ms
[2023-03-20 03:06:34] [INFO ] Flatten gal took : 7 ms
[2023-03-20 03:06:34] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10049 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=223 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:06:35] [INFO ] Invariant cache hit.
[2023-03-20 03:06:35] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 18 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2023-03-20 03:06:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 03:06:35] [INFO ] Invariant cache hit.
[2023-03-20 03:06:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-20 03:06:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:35] [INFO ] Invariant cache hit.
[2023-03-20 03:06:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s19 1)), p1:(AND (LT s1 1) (OR (LT s8 1) (LT s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10 reset in 352 ms.
Stack based approach found an accepted trace after 76477 steps with 21 reset with depth 76338 and stack size 24759 in 338 ms.
FORMULA TCPcondis-PT-50-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-00 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 13 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
[2023-03-20 03:06:36] [INFO ] Invariant cache hit.
[2023-03-20 03:06:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 03:06:36] [INFO ] Invariant cache hit.
[2023-03-20 03:06:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-20 03:06:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:36] [INFO ] Invariant cache hit.
[2023-03-20 03:06:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s19 1)) (AND (GEQ s19 1) (GEQ s4 1) (GEQ s17 1))), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Stack based approach found an accepted trace after 59556 steps with 0 reset with depth 59557 and stack size 59557 in 154 ms.
FORMULA TCPcondis-PT-50-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-01 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X((p1&&X(p2)))))&&F(!p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:37] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-20 03:06:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 03:06:37] [INFO ] Invariant cache hit.
[2023-03-20 03:06:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-20 03:06:37] [INFO ] Invariant cache hit.
[2023-03-20 03:06:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=5, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(LT s18 1), p2:(OR (LT s10 1) (LT s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 4 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-02 finished in 524 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) U X((X(F(p2))||p1))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:37] [INFO ] Invariant cache hit.
[2023-03-20 03:06:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 03:06:37] [INFO ] Invariant cache hit.
[2023-03-20 03:06:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-20 03:06:37] [INFO ] Invariant cache hit.
[2023-03-20 03:06:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (NOT (AND (GEQ s10 1) (GEQ s24 1))) (NOT (AND (GEQ s2 1) (GEQ s20 1)))), p2:(LT s16 1), p1:(OR (LT s10 1) (LT s28 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 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 99 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 p0 p2 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 140 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-50-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-50-LTLFireability-03 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||G(p1)||G(p2)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:38] [INFO ] Invariant cache hit.
[2023-03-20 03:06:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 03:06:38] [INFO ] Invariant cache hit.
[2023-03-20 03:06:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-20 03:06:38] [INFO ] Invariant cache hit.
[2023-03-20 03:06:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s19 1)), p0:(OR (LT s10 1) (LT s28 1)), p2:(OR (LT s8 1) (LT s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15375 reset in 125 ms.
Product exploration explored 100000 steps with 15450 reset in 124 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 p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2))))]
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 4) seen :3
Finished Best-First random walk after 385 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=385 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 447 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:40] [INFO ] Invariant cache hit.
[2023-03-20 03:06:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 03:06:40] [INFO ] Invariant cache hit.
[2023-03-20 03:06:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-20 03:06:40] [INFO ] Invariant cache hit.
[2023-03-20 03:06:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 491 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :3
Finished Best-First random walk after 5042 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=840 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15432 reset in 132 ms.
Product exploration explored 100000 steps with 15495 reset in 144 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-20 03:06:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-20 03:06:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 29/30 places, 31/32 transitions.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:42] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-04 finished in 3772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s20 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 42 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-05 finished in 217 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&&(!p1 U (G(!p1)||(!p1&&F(p2)&&G(!p3))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s3 1) (LT s19 1)), p1:(AND (GEQ s10 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-06 finished in 227 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)&&!F(X(p1))) U !(F(p0)&&p2)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (AND p0 p2), (OR (AND p0 p2) (AND p0 p1)), p1, (OR (NOT p0) p2 p1), p0]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(GEQ s0 1), p0:(AND (GEQ s5 1) (GEQ s21 1)), p1:(AND (GEQ s5 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-50-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-07 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:43] [INFO ] Invariant cache hit.
[2023-03-20 03:06:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 03:06:43] [INFO ] Invariant cache hit.
[2023-03-20 03:06:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-20 03:06:43] [INFO ] Invariant cache hit.
[2023-03-20 03:06:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s20 1)) (AND (GEQ s11 1) (GEQ s27 1)) (AND (GEQ s9 1) (GEQ s25 1))), p1:(OR (LT s15 1) (AND (GEQ s11 1) (GEQ s27 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14115 reset in 106 ms.
Product exploration explored 100000 steps with 14238 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 03:06:44] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 18 ms returned sat
[2023-03-20 03:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:06:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 03:06:44] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 03:06:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:06:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 03:06:44] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 03:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:06:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-20 03:06:44] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 03:06:44] [INFO ] Added : 23 causal constraints over 6 iterations in 157 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:44] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 03:06:45] [INFO ] Invariant cache hit.
[2023-03-20 03:06:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 03:06:45] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 03:06:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:06:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-20 03:06:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:06:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 03:06:45] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 03:06:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:06:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-20 03:06:45] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 03:06:45] [INFO ] Added : 9 causal constraints over 3 iterations in 115 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14158 reset in 96 ms.
Product exploration explored 100000 steps with 14266 reset in 116 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:46] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 32/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:46] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 3432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s20 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 13 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-09 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-20 03:06:46] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 03:06:46] [INFO ] Invariant cache hit.
[2023-03-20 03:06:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-20 03:06:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:47] [INFO ] Invariant cache hit.
[2023-03-20 03:06:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3996 reset in 157 ms.
Stack based approach found an accepted trace after 39720 steps with 614 reset with depth 24 and stack size 24 in 75 ms.
FORMULA TCPcondis-PT-50-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-11 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 8 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-20 03:06:47] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 03:06:47] [INFO ] Invariant cache hit.
[2023-03-20 03:06:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-20 03:06:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:47] [INFO ] Invariant cache hit.
[2023-03-20 03:06:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s11 1)], 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 0 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 245 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-20 03:06:48] [INFO ] Invariant cache hit.
[2023-03-20 03:06:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 03:06:48] [INFO ] Invariant cache hit.
[2023-03-20 03:06:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-20 03:06:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:48] [INFO ] Invariant cache hit.
[2023-03-20 03:06:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 246 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-20 03:06:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 25/25 places, 25/25 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-12 finished in 2322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-20 03:06:49] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-20 03:06:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1870 reset in 168 ms.
Stack based approach found an accepted trace after 6915 steps with 129 reset with depth 12 and stack size 12 in 12 ms.
FORMULA TCPcondis-PT-50-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-13 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
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 15 place count 23 transition count 24
Applied a total of 15 rules in 11 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-20 03:06:50] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 03:06:50] [INFO ] Invariant cache hit.
[2023-03-20 03:06:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-20 03:06:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:06:50] [INFO ] Invariant cache hit.
[2023-03-20 03:06:50] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s18 1)) (AND (GEQ s10 1) (GEQ s19 1) (GEQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12333 reset in 113 ms.
Stack based approach found an accepted trace after 44 steps with 6 reset with depth 16 and stack size 16 in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-14 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (F(!p1)||X(X(G(p2)))))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:50] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 03:06:50] [INFO ] Invariant cache hit.
[2023-03-20 03:06:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-20 03:06:50] [INFO ] Invariant cache hit.
[2023-03-20 03:06:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s26 1) (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p0:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p2:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3174 reset in 159 ms.
Product exploration explored 100000 steps with 3156 reset in 173 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 p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 354 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Incomplete random walk after 10024 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 5) seen :3
Finished Best-First random walk after 314 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND (NOT p2) p1)), (F (AND p2 p0 p1))]
Knowledge based reduction with 8 factoid took 513 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-20 03:06:52] [INFO ] Invariant cache hit.
[2023-03-20 03:06:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 03:06:52] [INFO ] Invariant cache hit.
[2023-03-20 03:06:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-20 03:06:52] [INFO ] Invariant cache hit.
[2023-03-20 03:06:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 365 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 5) seen :3
Finished Best-First random walk after 198 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=198 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p0) p1)), (F p1), (F (AND p1 (NOT p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 8 factoid took 509 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 174 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Product exploration explored 100000 steps with 3132 reset in 163 ms.
Product exploration explored 100000 steps with 3229 reset in 166 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 170 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 9 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-20 03:06:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-20 03:06:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 03:06:54] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 03:06:54] [INFO ] Invariant cache hit.
[2023-03-20 03:06:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-20 03:06:54] [INFO ] Invariant cache hit.
[2023-03-20 03:06:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-15 finished in 4486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||G(p1)||G(p2)))))'
Found a Shortening insensitive property : TCPcondis-PT-50-LTLFireability-04
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Applied a total of 6 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-20 03:06:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 03:06:55] [INFO ] Invariant cache hit.
[2023-03-20 03:06:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-20 03:06:55] [INFO ] Invariant cache hit.
[2023-03-20 03:06:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/30 places, 29/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 127 ms. Remains : 27/30 places, 29/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s18 1)), p0:(OR (LT s10 1) (LT s26 1)), p2:(OR (LT s8 1) (LT s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15537 reset in 121 ms.
Product exploration explored 100000 steps with 15502 reset in 134 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 p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2))))]
Knowledge based reduction with 8 factoid took 384 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Finished random walk after 1789 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=596 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 480 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 03:06:56] [INFO ] Invariant cache hit.
[2023-03-20 03:06:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-20 03:06:56] [INFO ] Invariant cache hit.
[2023-03-20 03:06:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-20 03:06:56] [INFO ] Invariant cache hit.
[2023-03-20 03:06:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 27/27 places, 29/29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Finished random walk after 2695 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=385 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 482 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15429 reset in 131 ms.
Product exploration explored 100000 steps with 15576 reset in 131 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 2 place count 27 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 4 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 03:06:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 27 cols
[2023-03-20 03:06:58] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/27 places, 29/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-20 03:06:58] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:06:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 03:06:58] [INFO ] Invariant cache hit.
[2023-03-20 03:06:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-20 03:06:58] [INFO ] Invariant cache hit.
[2023-03-20 03:06:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 27/27 places, 29/29 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-04 finished in 3668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Found a Shortening insensitive property : TCPcondis-PT-50-LTLFireability-08
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Applied a total of 6 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-20 03:06:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 03:06:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 03:06:58] [INFO ] Invariant cache hit.
[2023-03-20 03:06:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-20 03:06:59] [INFO ] Invariant cache hit.
[2023-03-20 03:06:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/30 places, 29/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 112 ms. Remains : 27/30 places, 29/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1)) (AND (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s8 1) (GEQ s22 1))), p1:(OR (LT s13 1) (AND (GEQ s10 1) (GEQ s24 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14289 reset in 100 ms.
Product exploration explored 100000 steps with 14355 reset in 105 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-20 03:06:59] [INFO ] Invariant cache hit.
[2023-03-20 03:07:00] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 03:07:00] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 03:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 03:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:07:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 03:07:00] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-20 03:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-20 03:07:00] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 03:07:00] [INFO ] Added : 21 causal constraints over 5 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 03:07:00] [INFO ] Invariant cache hit.
[2023-03-20 03:07:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 03:07:00] [INFO ] Invariant cache hit.
[2023-03-20 03:07:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-20 03:07:00] [INFO ] Invariant cache hit.
[2023-03-20 03:07:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 27/27 places, 29/29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 03:07:01] [INFO ] Invariant cache hit.
[2023-03-20 03:07:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 03:07:01] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-20 03:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 03:07:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:07:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 03:07:01] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-20 03:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-20 03:07:01] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 03:07:01] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14241 reset in 98 ms.
Product exploration explored 100000 steps with 14264 reset in 101 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 03:07:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 03:07:01] [INFO ] Invariant cache hit.
[2023-03-20 03:07:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 03:07:01] [INFO ] Invariant cache hit.
[2023-03-20 03:07:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 03:07:01] [INFO ] Invariant cache hit.
[2023-03-20 03:07:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-20 03:07:01] [INFO ] Invariant cache hit.
[2023-03-20 03:07:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 27/27 places, 29/29 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 3268 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (F(!p1)||X(X(G(p2)))))))'
Found a Lengthening insensitive property : TCPcondis-PT-50-LTLFireability-15
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 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 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 4 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-20 03:07:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:07:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-20 03:07:02] [INFO ] Invariant cache hit.
[2023-03-20 03:07:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-20 03:07:02] [INFO ] Invariant cache hit.
[2023-03-20 03:07:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 116 ms. Remains : 25/30 places, 27/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s22 1) (GEQ s9 1) (GEQ s10 1) (GEQ s24 1)), p0:(AND (GEQ s12 1) (GEQ s21 1) (GEQ s22 1)), p2:(AND (GEQ s4 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3184 reset in 164 ms.
Product exploration explored 100000 steps with 3291 reset in 165 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 p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 5) seen :3
Finished Best-First random walk after 179 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND (NOT p2) p1)), (F (AND p2 p0 p1))]
Knowledge based reduction with 8 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-20 03:07:04] [INFO ] Invariant cache hit.
[2023-03-20 03:07:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 03:07:04] [INFO ] Invariant cache hit.
[2023-03-20 03:07:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-20 03:07:04] [INFO ] Invariant cache hit.
[2023-03-20 03:07:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 25/25 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Incomplete random walk after 10049 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=478 ) properties (out of 5) seen :3
Finished Best-First random walk after 173 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=173 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p0) p1)), (F p1), (F (AND p1 (NOT p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 8 factoid took 478 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 261 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Product exploration explored 100000 steps with 3229 reset in 163 ms.
Product exploration explored 100000 steps with 3240 reset in 161 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 143 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 2 place count 25 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 4 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-20 03:07:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 25 cols
[2023-03-20 03:07:06] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:07:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 25/25 places, 27/27 transitions.
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-20 03:07:06] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 03:07:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 03:07:06] [INFO ] Invariant cache hit.
[2023-03-20 03:07:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-20 03:07:06] [INFO ] Invariant cache hit.
[2023-03-20 03:07:06] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 25/25 places, 27/27 transitions.
Treatment of property TCPcondis-PT-50-LTLFireability-15 finished in 4354 ms.
[2023-03-20 03:07:06] [INFO ] Flatten gal took : 4 ms
[2023-03-20 03:07:06] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-20 03:07:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 0 ms.
Total runtime 32243 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2475/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2475/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2475/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2475/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TCPcondis-PT-50-LTLFireability-04
Could not compute solution for formula : TCPcondis-PT-50-LTLFireability-08
Could not compute solution for formula : TCPcondis-PT-50-LTLFireability-12
Could not compute solution for formula : TCPcondis-PT-50-LTLFireability-15

BK_STOP 1679281627851

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TCPcondis-PT-50-LTLFireability-04
ltl formula formula --ltl=/tmp/2475/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 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2475/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2475/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2475/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2475/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
malloc_consolidate(): invalid chunk size
ltl formula name TCPcondis-PT-50-LTLFireability-08
ltl formula formula --ltl=/tmp/2475/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2475/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2475/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2475/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2475/ltl_1_
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:
malloc_consolidate(): invalid chunk size
ltl formula name TCPcondis-PT-50-LTLFireability-12
ltl formula formula --ltl=/tmp/2475/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2475/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2475/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2475/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2475/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TCPcondis-PT-50-LTLFireability-15
ltl formula formula --ltl=/tmp/2475/ltl_3_
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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2475/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2475/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2475/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2475/ltl_3_
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:
corrupted size vs. prev_size in fastbins

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="TCPcondis-PT-50"
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 TCPcondis-PT-50, 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 r489-tall-167912706900564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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