fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912706900516
Last Updated
May 14, 2023

About the Execution of LTSMin+red for TCPcondis-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
411.640 15415.00 24783.00 394.40 FFFFFFFF?TFFFFTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:19 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 13K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:10 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-15-LTLFireability-00
FORMULA_NAME TCPcondis-PT-15-LTLFireability-01
FORMULA_NAME TCPcondis-PT-15-LTLFireability-02
FORMULA_NAME TCPcondis-PT-15-LTLFireability-03
FORMULA_NAME TCPcondis-PT-15-LTLFireability-04
FORMULA_NAME TCPcondis-PT-15-LTLFireability-05
FORMULA_NAME TCPcondis-PT-15-LTLFireability-06
FORMULA_NAME TCPcondis-PT-15-LTLFireability-07
FORMULA_NAME TCPcondis-PT-15-LTLFireability-08
FORMULA_NAME TCPcondis-PT-15-LTLFireability-09
FORMULA_NAME TCPcondis-PT-15-LTLFireability-10
FORMULA_NAME TCPcondis-PT-15-LTLFireability-11
FORMULA_NAME TCPcondis-PT-15-LTLFireability-12
FORMULA_NAME TCPcondis-PT-15-LTLFireability-13
FORMULA_NAME TCPcondis-PT-15-LTLFireability-14
FORMULA_NAME TCPcondis-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679266649877

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-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 22:57:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:57:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:57:31] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 22:57:31] [WARNING] Unknown XML tag in source file: size
[2023-03-19 22:57:31] [WARNING] Unknown XML tag in source file: color
[2023-03-19 22:57:31] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-19 22:57:31] [INFO ] Transformed 30 places.
[2023-03-19 22:57:31] [INFO ] Transformed 32 transitions.
[2023-03-19 22:57:31] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 88 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 7 formulas.
FORMULA TCPcondis-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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-19 22:57:31] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-19 22:57:31] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 22:57:31] [INFO ] Invariant cache hit.
[2023-03-19 22:57:31] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 22:57:31] [INFO ] Invariant cache hit.
[2023-03-19 22:57:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 21 out of 30 places after structural reductions.
[2023-03-19 22:57:32] [INFO ] Flatten gal took : 19 ms
[2023-03-19 22:57:32] [INFO ] Flatten gal took : 7 ms
[2023-03-19 22:57:32] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 20 out of 30 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 15) seen :14
Finished Best-First random walk after 785 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=196 )
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)))'
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 14 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 22:57:32] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 22:57:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 22:57:32] [INFO ] Invariant cache hit.
[2023-03-19 22:57:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 22:57:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 22:57:32] [INFO ] Invariant cache hit.
[2023-03-19 22:57:32] [INFO ] Dead Transitions using invariants and state equation in 39 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 156 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-00 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 (LT s4 1) (LT s16 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 2325 reset in 299 ms.
Stack based approach found an accepted trace after 52298 steps with 1208 reset with depth 50 and stack size 50 in 125 ms.
FORMULA TCPcondis-PT-15-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-00 finished in 807 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((F(p1)&&F(G(p2))))&&p0)))'
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 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
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 14 place count 24 transition count 24
Applied a total of 14 rules in 14 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 22:57:33] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-19 22:57:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 22:57:33] [INFO ] Invariant cache hit.
[2023-03-19 22:57:33] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 22:57:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:33] [INFO ] Invariant cache hit.
[2023-03-19 22:57:33] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s19 1)), p2:(AND (GEQ s5 1) (GEQ s15 1)), p0:(AND (GEQ s4 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 226 ms.
Stack based approach found an accepted trace after 11730 steps with 0 reset with depth 11731 and stack size 11731 in 31 ms.
FORMULA TCPcondis-PT-15-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-03 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(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 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-19 22:57:34] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16 1), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1) (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-04 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 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-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-05 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((X(p2)||p1))||p0))))'
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-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 22:57:34] [INFO ] Invariant cache hit.
[2023-03-19 22:57:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (OR (LT s12 1) (LT s26 1)) (OR (LT s6 1) (LT s19 1))) (LT s24 1)), p0:(OR (LT s12 1) (LT s26 1)), p2:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1659 reset in 274 ms.
Product exploration explored 100000 steps with 1615 reset in 274 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 p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 624 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 2802 steps, including 0 resets, run visited all 6 properties in 20 ms. (steps per millisecond=140 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 719 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT 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-19 22:57:37] [INFO ] Invariant cache hit.
[2023-03-19 22:57:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 22:57:37] [INFO ] Invariant cache hit.
[2023-03-19 22:57:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 22:57:37] [INFO ] Invariant cache hit.
[2023-03-19 22:57:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 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 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 594 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 6) seen :5
Finished Best-First random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 876 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1742 reset in 217 ms.
Stack based approach found an accepted trace after 93384 steps with 1523 reset with depth 116 and stack size 116 in 210 ms.
FORMULA TCPcondis-PT-15-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-06 finished in 5247 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 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 1 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 10 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 22:57:39] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:57:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 22:57:40] [INFO ] Invariant cache hit.
[2023-03-19 22:57:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-19 22:57:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:40] [INFO ] Invariant cache hit.
[2023-03-19 22:57:40] [INFO ] Dead Transitions using invariants and state equation in 55 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 172 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s7 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 184 ms.
Stack based approach found an accepted trace after 21808 steps with 0 reset with depth 21809 and stack size 21807 in 44 ms.
FORMULA TCPcondis-PT-15-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-07 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F(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 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 8 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 22:57:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:57:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 22:57:40] [INFO ] Invariant cache hit.
[2023-03-19 22:57:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 22:57:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:40] [INFO ] Invariant cache hit.
[2023-03-19 22:57:40] [INFO ] Dead Transitions using invariants and state equation in 30 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 117 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s2 1), p0:(OR (LT s4 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9772 reset in 113 ms.
Product exploration explored 100000 steps with 9762 reset in 125 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), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 400 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
[2023-03-19 22:57:41] [INFO ] Invariant cache hit.
[2023-03-19 22:57:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:57:41] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:57:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:57:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:57:41] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:57:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:57:42] [INFO ] Computed and/alt/rep : 20/74/20 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-19 22:57:42] [INFO ] Added : 16 causal constraints over 4 iterations in 89 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-19 22:57:42] [INFO ] Invariant cache hit.
[2023-03-19 22:57:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 22:57:42] [INFO ] Invariant cache hit.
[2023-03-19 22:57:42] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 22:57:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:42] [INFO ] Invariant cache hit.
[2023-03-19 22:57:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 22/22 places, 22/22 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
[2023-03-19 22:57:42] [INFO ] Invariant cache hit.
[2023-03-19 22:57:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:57:42] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:57:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-19 22:57:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:57:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:57:42] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:57:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:57:42] [INFO ] Computed and/alt/rep : 20/74/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:57:42] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 9787 reset in 125 ms.
Product exploration explored 100000 steps with 9852 reset in 110 ms.
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 22:57:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property TCPcondis-PT-15-LTLFireability-08 finished in 2759 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)&&F(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 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 5 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 22:57:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-19 22:57:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Dead Transitions using invariants and state equation in 36 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 141 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s11 1) (GEQ s19 1) (GEQ s20 1)), p0:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9105 reset in 126 ms.
Stack based approach found an accepted trace after 2967 steps with 277 reset with depth 16 and stack size 16 in 3 ms.
FORMULA TCPcondis-PT-15-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-12 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 8 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 22:57:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 22:57:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:57:43] [INFO ] Invariant cache hit.
[2023-03-19 22:57:43] [INFO ] Dead Transitions using invariants and state equation in 31 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 122 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s18 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 186 ms.
Stack based approach found an accepted trace after 234 steps with 0 reset with depth 235 and stack size 235 in 0 ms.
FORMULA TCPcondis-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-13 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F(p1)))'
[2023-03-19 22:57:44] [INFO ] Flatten gal took : 6 ms
[2023-03-19 22:57:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 22:57:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 12929 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1137/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TCPcondis-PT-15-LTLFireability-08

BK_STOP 1679266665292

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TCPcondis-PT-15-LTLFireability-08
ltl formula formula --ltl=/tmp/1137/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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1137/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1137/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1137/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1137/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-15"
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-15, 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-167912706900516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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