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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:05 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.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 16:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 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-10-LTLFireability-00
FORMULA_NAME TCPcondis-PT-10-LTLFireability-01
FORMULA_NAME TCPcondis-PT-10-LTLFireability-02
FORMULA_NAME TCPcondis-PT-10-LTLFireability-03
FORMULA_NAME TCPcondis-PT-10-LTLFireability-04
FORMULA_NAME TCPcondis-PT-10-LTLFireability-05
FORMULA_NAME TCPcondis-PT-10-LTLFireability-06
FORMULA_NAME TCPcondis-PT-10-LTLFireability-07
FORMULA_NAME TCPcondis-PT-10-LTLFireability-08
FORMULA_NAME TCPcondis-PT-10-LTLFireability-09
FORMULA_NAME TCPcondis-PT-10-LTLFireability-10
FORMULA_NAME TCPcondis-PT-10-LTLFireability-11
FORMULA_NAME TCPcondis-PT-10-LTLFireability-12
FORMULA_NAME TCPcondis-PT-10-LTLFireability-13
FORMULA_NAME TCPcondis-PT-10-LTLFireability-14
FORMULA_NAME TCPcondis-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679265342414

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-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 22:35:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:35:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:35:44] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 22:35:44] [WARNING] Unknown XML tag in source file: size
[2023-03-19 22:35:44] [WARNING] Unknown XML tag in source file: color
[2023-03-19 22:35:44] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-19 22:35:44] [INFO ] Transformed 30 places.
[2023-03-19 22:35:44] [INFO ] Transformed 32 transitions.
[2023-03-19 22:35:44] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 92 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-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 11 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:35:44] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-19 22:35:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 22:35:44] [INFO ] Invariant cache hit.
[2023-03-19 22:35:44] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-19 22:35:44] [INFO ] Invariant cache hit.
[2023-03-19 22:35:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2023-03-19 22:35:44] [INFO ] Flatten gal took : 19 ms
[2023-03-19 22:35:44] [INFO ] Flatten gal took : 6 ms
[2023-03-19 22:35:44] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 1013 steps, including 0 resets, run visited all 24 properties in 36 ms. (steps per millisecond=28 )
FORMULA TCPcondis-PT-10-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X((X(F(!p3))&&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-19 22:35:45] [INFO ] Invariant cache hit.
[2023-03-19 22:35:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 22:35:45] [INFO ] Invariant cache hit.
[2023-03-19 22:35:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 22:35:45] [INFO ] Invariant cache hit.
[2023-03-19 22:35:45] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p3), true, p3, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s0 1), p1:(LT s1 1), p2:(AND (GEQ s8 1) (GEQ s20 1)), p3:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 5 ms.
FORMULA TCPcondis-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-00 finished in 731 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((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 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 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 16 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:35:46] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:35:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 22:35:46] [INFO ] Invariant cache hit.
[2023-03-19 22:35:46] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 22:35:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:35:46] [INFO ] Invariant cache hit.
[2023-03-19 22:35:46] [INFO ] Dead Transitions using invariants and state equation in 36 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 137 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s19 1)), p0:(OR (LT s3 1) (LT s16 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 563 reset in 314 ms.
Stack based approach found an accepted trace after 4672 steps with 27 reset with depth 35 and stack size 35 in 15 ms.
FORMULA TCPcondis-PT-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-01 finished in 615 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((p1&&X(F(p2))))))'
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 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:35:46] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 22:35:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 22:35:46] [INFO ] Invariant cache hit.
[2023-03-19 22:35:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 22:35:46] [INFO ] Invariant cache hit.
[2023-03-19 22:35:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s24 1), p0:(OR (AND (GEQ s4 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s25 1))), p2:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7029 reset in 140 ms.
Product exploration explored 100000 steps with 6960 reset in 226 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 (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 293 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 199 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
[2023-03-19 22:35:48] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-03-19 22:35:48] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p2), (F p1), (G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-10-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-10-LTLFireability-02 finished in 2026 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((F(X(p0)) U p1))))'
Support contains 3 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:35:48] [INFO ] Invariant cache hit.
[2023-03-19 22:35:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 22:35:48] [INFO ] Invariant cache hit.
[2023-03-19 22:35:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 22:35:48] [INFO ] Invariant cache hit.
[2023-03-19 22:35:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2450 reset in 182 ms.
Product exploration explored 100000 steps with 2493 reset in 198 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)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-19 22:35:50] [INFO ] Invariant cache hit.
[2023-03-19 22:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:35:50] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 22:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 22:35:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:35:50] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-19 22:35:50] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-19 22:35:50] [INFO ] Added : 25 causal constraints over 5 iterations in 47 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 22:35:50] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-10-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-10-LTLFireability-03 finished in 2166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((!p1 U 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 22:35:50] [INFO ] Invariant cache hit.
[2023-03-19 22:35:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 22:35:50] [INFO ] Invariant cache hit.
[2023-03-19 22:35:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 22:35:50] [INFO ] Invariant cache hit.
[2023-03-19 22:35:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(AND (GEQ s5 1) (GEQ s23 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 204 ms.
Stack based approach found an accepted trace after 27259 steps with 6 reset with depth 27060 and stack size 27060 in 67 ms.
FORMULA TCPcondis-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-04 finished in 647 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)||!(!p0 U X((p0 U X(p1))))))'
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-19 22:35:51] [INFO ] Invariant cache hit.
[2023-03-19 22:35:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 22:35:51] [INFO ] Invariant cache hit.
[2023-03-19 22:35:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 22:35:51] [INFO ] Invariant cache hit.
[2023-03-19 22:35:51] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), p1, true, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s22 1)), p1:(AND (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24942 reset in 96 ms.
Product exploration explored 100000 steps with 25012 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 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 5903 steps, including 1 resets, run visited all 6 properties in 15 ms. (steps per millisecond=393 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 460 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 219 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
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-19 22:35:53] [INFO ] Invariant cache hit.
[2023-03-19 22:35:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 22:35:53] [INFO ] Invariant cache hit.
[2023-03-19 22:35:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 22:35:53] [INFO ] Invariant cache hit.
[2023-03-19 22:35:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 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) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 9257 steps, including 2 resets, run visited all 6 properties in 22 ms. (steps per millisecond=420 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 199 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Entered a terminal (fully accepting) state of product in 214 steps with 3 reset in 1 ms.
FORMULA TCPcondis-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-05 finished in 3666 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(F((p1||G(!p2))))))'
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 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
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 10 place count 26 transition count 26
Applied a total of 10 rules in 11 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-19 22:35:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:35:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 22:35:55] [INFO ] Invariant cache hit.
[2023-03-19 22:35:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 22:35:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:35:55] [INFO ] Invariant cache hit.
[2023-03-19 22:35:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s14 1)), p2:(LT s1 1), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 993 reset in 177 ms.
Product exploration explored 100000 steps with 1047 reset in 179 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) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 381 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 210 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=210 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 22:35:57] [INFO ] Invariant cache hit.
[2023-03-19 22:35:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 22:35:57] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 22:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:35:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 22:35:57] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 22:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:35:57] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 22:35:57] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-19 22:35:57] [INFO ] Invariant cache hit.
[2023-03-19 22:35:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 22:35:57] [INFO ] Invariant cache hit.
[2023-03-19 22:35:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-19 22:35:57] [INFO ] Invariant cache hit.
[2023-03-19 22:35:57] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 26/26 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 199 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 22:35:58] [INFO ] Invariant cache hit.
[2023-03-19 22:35:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 22:35:58] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 22:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:35:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 22:35:58] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 22:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:35:58] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:35:58] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 971 reset in 175 ms.
Stack based approach found an accepted trace after 82901 steps with 772 reset with depth 20 and stack size 20 in 159 ms.
FORMULA TCPcondis-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-06 finished in 3797 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) U p1)))'
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.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 22:35:59] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s22 1)), p0:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-07 finished in 239 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(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:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-09 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(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, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-09 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' '!((p0 U X(X((p1||X(F(p2)))))))'
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 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 22:35:59] [INFO ] Invariant cache hit.
[2023-03-19 22:35:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=1, aps=[p2:(OR (LT s10 1) (LT s28 1)), p0:(OR (AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)) (AND (GEQ s8 1) (GEQ s20 1))), p1:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13792 reset in 119 ms.
Product exploration explored 100000 steps with 13947 reset in 129 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 p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 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-19 22:36:01] [INFO ] Invariant cache hit.
[2023-03-19 22:36:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 22:36:01] [INFO ] Invariant cache hit.
[2023-03-19 22:36:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 22:36:01] [INFO ] Invariant cache hit.
[2023-03-19 22:36:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13881 reset in 111 ms.
Product exploration explored 100000 steps with 13893 reset in 127 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
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: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 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 10 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 10 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 13 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 22:36:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 22:36:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:36:02] [INFO ] Dead Transitions using invariants and state equation in 31 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 52 ms. Remains : 28/30 places, 30/32 transitions.
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 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-19 22:36:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:36:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 22:36:02] [INFO ] Invariant cache hit.
[2023-03-19 22:36:02] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 22:36:02] [INFO ] Invariant cache hit.
[2023-03-19 22:36:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-10-LTLFireability-10 finished in 3224 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(G(p0)) U (p1 U !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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 22:36:02] [INFO ] Invariant cache hit.
[2023-03-19 22:36:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 22:36:02] [INFO ] Invariant cache hit.
[2023-03-19 22:36:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 22:36:02] [INFO ] Invariant cache hit.
[2023-03-19 22:36:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 241 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s21 1)), p1:(OR (NOT (AND (GEQ s9 1) (GEQ s25 1))) (AND (GEQ s5 1) (GEQ s21 1))), p0:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2013 reset in 182 ms.
Product exploration explored 100000 steps with 2023 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 698 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 22:36:04] [INFO ] Invariant cache hit.
[2023-03-19 22:36:04] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p0) p1 p2)), (F (AND p1 p2)), (F p2)]
Knowledge based reduction with 15 factoid took 727 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p2, p2]
Stuttering acceptance computed with spot in 59 ms :[p2, p2]
Support contains 2 out of 30 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 : 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 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:36:05] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 22:36:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 22:36:05] [INFO ] Invariant cache hit.
[2023-03-19 22:36:05] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 22:36:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 22:36:05] [INFO ] Invariant cache hit.
[2023-03-19 22:36:05] [INFO ] Dead Transitions using invariants and state equation in 31 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 112 ms. Remains : 23/30 places, 24/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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[p2, p2]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=100 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[p2, p2]
Stuttering acceptance computed with spot in 78 ms :[p2, p2]
Stuttering acceptance computed with spot in 73 ms :[p2, p2]
Product exploration explored 100000 steps with 2127 reset in 166 ms.
Product exploration explored 100000 steps with 2120 reset in 170 ms.
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 23 transition count 22
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 3 place count 22 transition count 22
Applied a total of 3 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 22:36:06] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 22:36:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 22:36:06] [INFO ] Invariant cache hit.
[2023-03-19 22:36:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 22:36:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:36:06] [INFO ] Invariant cache hit.
[2023-03-19 22:36:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/23 places, 22/24 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 22/23 places, 22/24 transitions.
Treatment of property TCPcondis-PT-10-LTLFireability-11 finished in 3852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (F(p2)&&p1))))'
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 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-19 22:36:06] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 22:36:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 22:36:06] [INFO ] Invariant cache hit.
[2023-03-19 22:36:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 22:36:06] [INFO ] Invariant cache hit.
[2023-03-19 22:36:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s28 1)), p2:(AND (GEQ s7 1) (GEQ s19 1)), p0:(GEQ s29 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1689 reset in 169 ms.
Product exploration explored 100000 steps with 1681 reset in 170 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 p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 254 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F p2), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 441 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:36:08] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 22:36:08] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-19 22:36:08] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:08] [INFO ] Added : 25 causal constraints over 5 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:36:08] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-19 22:36:08] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:08] [INFO ] Added : 22 causal constraints over 5 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
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 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 22:36:08] [INFO ] Invariant cache hit.
[2023-03-19 22:36:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 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) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 144 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F p2), (F p0), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 530 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-19 22:36:10] [INFO ] Invariant cache hit.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-19 22:36:10] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:10] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 22:36:10] [INFO ] Invariant cache hit.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 22:36:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-19 22:36:10] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 22:36:10] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:36:10] [INFO ] Invariant cache hit.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 22:36:10] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 22:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:36:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 22:36:10] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 22:36:10] [INFO ] Added : 22 causal constraints over 5 iterations in 32 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 1627 reset in 157 ms.
Product exploration explored 100000 steps with 1630 reset in 171 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
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 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 13 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2023-03-19 22:36:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2023-03-19 22:36:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:36:11] [INFO ] Dead Transitions using invariants and state equation in 28 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 51 ms. Remains : 29/30 places, 31/32 transitions.
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 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:36:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-10-LTLFireability-12 finished in 4944 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 6 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:36:11] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 22:36:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Dead Transitions using invariants and state equation in 23 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 94 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s21 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 180 ms.
Stack based approach found an accepted trace after 2018 steps with 0 reset with depth 2019 and stack size 2019 in 4 ms.
FORMULA TCPcondis-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-14 finished in 327 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 1 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 4 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:36:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 22:36:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:36:11] [INFO ] Invariant cache hit.
[2023-03-19 22:36:11] [INFO ] Dead Transitions using invariants and state equation in 24 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 90 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-15 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 s12 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 190 ms.
Stack based approach found an accepted trace after 2631 steps with 0 reset with depth 2632 and stack size 2632 in 6 ms.
FORMULA TCPcondis-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-15 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1||X(F(p2)))))))'
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(G(p0)) U (p1 U !p2))))'
Found a Lengthening insensitive property : TCPcondis-PT-10-LTLFireability-11
Stuttering acceptance computed with spot in 235 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_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
Applied a total of 12 rules in 3 ms. Remains 24 /30 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 24 cols
[2023-03-19 22:36:12] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 22:36:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 22:36:12] [INFO ] Invariant cache hit.
[2023-03-19 22:36:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 22:36:12] [INFO ] Invariant cache hit.
[2023-03-19 22:36:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/30 places, 26/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 85 ms. Remains : 24/30 places, 26/32 transitions.
Running random walk in product with property : TCPcondis-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s17 1)), p1:(OR (NOT (AND (GEQ s7 1) (GEQ s20 1))) (AND (GEQ s4 1) (GEQ s17 1))), p0:(AND (GEQ s7 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2106 reset in 169 ms.
Product exploration explored 100000 steps with 2104 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 710 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 22:36:14] [INFO ] Invariant cache hit.
[2023-03-19 22:36:14] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (AND (NOT p0) p1 p2)), (F (AND p1 p2)), (F p2)]
Knowledge based reduction with 15 factoid took 766 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p2, p2]
Stuttering acceptance computed with spot in 72 ms :[p2, p2]
Support contains 2 out of 24 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 : 24/24 places, 26/26 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 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 1 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 3 place count 23 transition count 24
Applied a total of 3 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-19 22:36:14] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 22:36:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 22:36:15] [INFO ] Invariant cache hit.
[2023-03-19 22:36:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 22:36:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 22:36:15] [INFO ] Invariant cache hit.
[2023-03-19 22:36:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/24 places, 24/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 23/24 places, 24/26 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 p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p2, p2]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p2, p2]
Stuttering acceptance computed with spot in 74 ms :[p2, p2]
Stuttering acceptance computed with spot in 81 ms :[p2, p2]
Product exploration explored 100000 steps with 2105 reset in 154 ms.
Stack based approach found an accepted trace after 13787 steps with 291 reset with depth 45 and stack size 45 in 22 ms.
Treatment of property TCPcondis-PT-10-LTLFireability-11 finished in 3557 ms.
FORMULA TCPcondis-PT-10-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (F(p2)&&p1))))'
[2023-03-19 22:36:15] [INFO ] Flatten gal took : 14 ms
[2023-03-19 22:36:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 22:36:15] [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 31826 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2709/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2709/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2709/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TCPcondis-PT-10-LTLFireability-10
Could not compute solution for formula : TCPcondis-PT-10-LTLFireability-11
Could not compute solution for formula : TCPcondis-PT-10-LTLFireability-12

BK_STOP 1679265377058

--------------------
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-10-LTLFireability-10
ltl formula formula --ltl=/tmp/2709/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( 3/ 4): LTL layer: formula: /tmp/2709/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2709/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2709/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2709/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TCPcondis-PT-10-LTLFireability-11
ltl formula formula --ltl=/tmp/2709/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
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
Warning: program compiled against libxml 210 using older 209
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2709/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2709/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2709/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2709/ltl_1_
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
ltl formula name TCPcondis-PT-10-LTLFireability-12
ltl formula formula --ltl=/tmp/2709/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
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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2709/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2709/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2709/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2709/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564a2b16c3f4]
1: pnml2lts-mc(+0xa2496) [0x564a2b16c496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fba80a29140]
3: pnml2lts-mc(+0x405be5) [0x564a2b4cfbe5]
4: pnml2lts-mc(+0x16b3f9) [0x564a2b2353f9]
5: pnml2lts-mc(+0x164ac4) [0x564a2b22eac4]
6: pnml2lts-mc(+0x272e0a) [0x564a2b33ce0a]
7: pnml2lts-mc(+0xb61f0) [0x564a2b1801f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fba8087c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fba8087c67a]
10: pnml2lts-mc(+0xa1581) [0x564a2b16b581]
11: pnml2lts-mc(+0xa1910) [0x564a2b16b910]
12: pnml2lts-mc(+0xa32a2) [0x564a2b16d2a2]
13: pnml2lts-mc(+0xa50f4) [0x564a2b16f0f4]
14: pnml2lts-mc(+0xa516b) [0x564a2b16f16b]
15: pnml2lts-mc(+0x3f34b3) [0x564a2b4bd4b3]
16: pnml2lts-mc(+0x7c63d) [0x564a2b14663d]
17: pnml2lts-mc(+0x67d86) [0x564a2b131d86]
18: pnml2lts-mc(+0x60a8a) [0x564a2b12aa8a]
19: pnml2lts-mc(+0x5eb15) [0x564a2b128b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fba80864d0a]
21: pnml2lts-mc(+0x6075e) [0x564a2b12a75e]

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-10"
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-10, 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-167912706900508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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