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.r485-tall-167912699500508.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 itstools
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 r485-tall-167912699500508
=====================================================================

--------------------
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 1679242176898

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 16:09:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 16:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:09:38] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 16:09:38] [WARNING] Unknown XML tag in source file: size
[2023-03-19 16:09:38] [WARNING] Unknown XML tag in source file: color
[2023-03-19 16:09:38] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-19 16:09:38] [INFO ] Transformed 30 places.
[2023-03-19 16:09:38] [INFO ] Transformed 32 transitions.
[2023-03-19 16:09:38] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 115 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 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 16:09:38] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 16:09:38] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-19 16:09:38] [INFO ] Invariant cache hit.
[2023-03-19 16:09:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-19 16:09:38] [INFO ] Invariant cache hit.
[2023-03-19 16:09:38] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2023-03-19 16:09:39] [INFO ] Flatten gal took : 19 ms
[2023-03-19 16:09:39] [INFO ] Flatten gal took : 6 ms
[2023-03-19 16:09:39] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 285 steps, including 0 resets, run visited all 24 properties in 20 ms. (steps per millisecond=14 )
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 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 426 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 58 steps with 0 reset in 3 ms.
FORMULA TCPcondis-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-00 finished in 635 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 18 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 16:09:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:09:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:09:40] [INFO ] Invariant cache hit.
[2023-03-19 16:09:40] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 16:09:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:09:40] [INFO ] Invariant cache hit.
[2023-03-19 16:09:40] [INFO ] Dead Transitions using invariants and state equation in 35 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 163 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 172 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 582 reset in 308 ms.
Stack based approach found an accepted trace after 2495 steps with 14 reset with depth 38 and stack size 38 in 7 ms.
FORMULA TCPcondis-PT-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-01 finished in 662 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 16:09:40] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:09:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:09:40] [INFO ] Invariant cache hit.
[2023-03-19 16:09:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 16:09:41] [INFO ] Invariant cache hit.
[2023-03-19 16:09:41] [INFO ] Dead Transitions using invariants and state equation in 32 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 212 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 7042 reset in 143 ms.
Product exploration explored 100000 steps with 7130 reset in 166 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 225 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 107 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
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 369 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 142 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-03-19 16:09:42] [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 232 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 1961 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 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 174 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 2477 reset in 169 ms.
Product exploration explored 100000 steps with 2471 reset in 187 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 194 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 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 78 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=26 )
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 237 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 170 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 16:09:44] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 16:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-19 16:09:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 16:09:44] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 16:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-19 16:09:44] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 16:09:44] [INFO ] Added : 25 causal constraints over 5 iterations in 32 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 16:09:44] [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 142 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 1923 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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 210 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 6 reset in 199 ms.
Stack based approach found an accepted trace after 44094 steps with 4 reset with depth 43986 and stack size 28008 in 149 ms.
FORMULA TCPcondis-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-04 finished in 714 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 16:09:45] [INFO ] Invariant cache hit.
[2023-03-19 16:09:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 16:09:45] [INFO ] Invariant cache hit.
[2023-03-19 16:09:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 16:09:45] [INFO ] Invariant cache hit.
[2023-03-19 16:09:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 292 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 24972 reset in 81 ms.
Product exploration explored 100000 steps with 25089 reset in 92 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 282 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 195 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :5
Finished Best-First random walk after 254 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=254 )
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 435 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))]
Stuttering acceptance computed with spot in 192 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 16:09:47] [INFO ] Invariant cache hit.
[2023-03-19 16:09:47] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 16:09:47] [INFO ] Invariant cache hit.
[2023-03-19 16:09:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 16:09:47] [INFO ] Invariant cache hit.
[2023-03-19 16:09:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 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 199 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 208 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 5395 steps, including 1 resets, run visited all 6 properties in 14 ms. (steps per millisecond=385 )
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 292 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 197 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[true, p1, (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 197 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 143 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-05 finished in 3427 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 14 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 16:09:49] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-19 16:09:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 16:09:49] [INFO ] Invariant cache hit.
[2023-03-19 16:09:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 16:09:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:09:49] [INFO ] Invariant cache hit.
[2023-03-19 16:09:49] [INFO ] Dead Transitions using invariants and state equation in 30 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 141 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 203 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 972 reset in 210 ms.
Product exploration explored 100000 steps with 926 reset in 223 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 289 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 159 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 3 ms. (steps per millisecond=70 )
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 425 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 171 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 16:09:51] [INFO ] Invariant cache hit.
[2023-03-19 16:09:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 16:09:51] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 16:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-19 16:09:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 16:09:51] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 16:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-19 16:09:51] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 16:09:51] [INFO ] Added : 16 causal constraints over 4 iterations in 138 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 16:09:51] [INFO ] Invariant cache hit.
[2023-03-19 16:09:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 16:09:51] [INFO ] Invariant cache hit.
[2023-03-19 16:09:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 16:09:51] [INFO ] Invariant cache hit.
[2023-03-19 16:09:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 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 257 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 146 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 2 ms. (steps per millisecond=105 )
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 332 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 142 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
[2023-03-19 16:09:52] [INFO ] Invariant cache hit.
[2023-03-19 16:09:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 16:09:52] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 16:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 16:09:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 16:09:52] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 16:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:52] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-19 16:09:52] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 16:09:52] [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 160 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 988 reset in 187 ms.
Stack based approach found an accepted trace after 86539 steps with 824 reset with depth 23 and stack size 23 in 176 ms.
FORMULA TCPcondis-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-06 finished in 4124 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 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 16:09:53] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 148 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 47 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 313 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 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 180 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 5 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 298 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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 16:09:53] [INFO ] Invariant cache hit.
[2023-03-19 16:09:53] [INFO ] Dead Transitions using invariants and state equation in 32 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 425 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 13337 reset in 112 ms.
Product exploration explored 100000 steps with 13380 reset in 116 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 198 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 125 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 217 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 114 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 133 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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 16:09:55] [INFO ] Invariant cache hit.
[2023-03-19 16:09:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 16:09:55] [INFO ] Invariant cache hit.
[2023-03-19 16:09:55] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 16:09:55] [INFO ] Invariant cache hit.
[2023-03-19 16:09:55] [INFO ] Dead Transitions using invariants and state equation in 30 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 : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 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 230 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 125 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=125 )
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 105 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 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13474 reset in 108 ms.
Product exploration explored 100000 steps with 13735 reset in 116 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 162 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 0 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 16:09:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 16:09:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:09:56] [INFO ] Dead Transitions using invariants and state equation in 32 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 57 ms. Remains : 28/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin7629485812386792748
[2023-03-19 16:09:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7629485812386792748
Running compilation step : cd /tmp/ltsmin7629485812386792748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin7629485812386792748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7629485812386792748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18252534620638471989.hoa' '--buchi-type=spotba'
LTSmin run took 850 ms.
FORMULA TCPcondis-PT-10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-10-LTLFireability-10 finished in 4353 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 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 16:09:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:09:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 16:09:58] [INFO ] Invariant cache hit.
[2023-03-19 16:09:58] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 16:09:58] [INFO ] Invariant cache hit.
[2023-03-19 16:09:58] [INFO ] Dead Transitions using invariants and state equation in 30 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 230 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 2036 reset in 176 ms.
Product exploration explored 100000 steps with 2050 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 652 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 208 ms :[p2, (NOT p0), p2, (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:09:59] [INFO ] Invariant cache hit.
[2023-03-19 16:09:59] [INFO ] After 153ms 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 782 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 73 ms :[p2, p2]
Stuttering acceptance computed with spot in 63 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 8 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 16:10:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 16:10:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 16:10:00] [INFO ] Invariant cache hit.
[2023-03-19 16:10:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 16:10:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:10:00] [INFO ] Invariant cache hit.
[2023-03-19 16:10:00] [INFO ] Dead Transitions using invariants and state equation in 27 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 104 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 93 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 84 ms :[p2, p2]
Finished random walk after 199 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=99 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 136 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 83 ms :[p2, p2]
Stuttering acceptance computed with spot in 80 ms :[p2, p2]
Stuttering acceptance computed with spot in 78 ms :[p2, p2]
Product exploration explored 100000 steps with 2122 reset in 158 ms.
Product exploration explored 100000 steps with 2112 reset in 162 ms.
Built C files in :
/tmp/ltsmin795887598836414087
[2023-03-19 16:10:01] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2023-03-19 16:10:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 16:10:01] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2023-03-19 16:10:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 16:10:01] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2023-03-19 16:10:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 16:10:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin795887598836414087
Running compilation step : cd /tmp/ltsmin795887598836414087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin795887598836414087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin795887598836414087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6933349586618850617.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA TCPcondis-PT-10-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-10-LTLFireability-11 finished in 4257 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 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 16:10:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 16:10:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 16:10:02] [INFO ] Invariant cache hit.
[2023-03-19 16:10:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 16:10:02] [INFO ] Invariant cache hit.
[2023-03-19 16:10:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 152 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 1708 reset in 193 ms.
Stack based approach found an accepted trace after 72875 steps with 1226 reset with depth 68 and stack size 68 in 153 ms.
FORMULA TCPcondis-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-12 finished in 611 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 7 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 16:10:02] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 16:10:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 16:10:02] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 16:10:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 27 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 108 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 39 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 181 ms.
Stack based approach found an accepted trace after 171 steps with 0 reset with depth 172 and stack size 172 in 0 ms.
FORMULA TCPcondis-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-14 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 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 7 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 16:10:03] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 16:10:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 27 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 105 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 37 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 180 ms.
Stack based approach found an accepted trace after 6319 steps with 0 reset with depth 6320 and stack size 6320 in 13 ms.
FORMULA TCPcondis-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-10-LTLFireability-15 finished in 353 ms.
All properties solved by simple procedures.
Total runtime 25311 ms.

BK_STOP 1679242204591

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r485-tall-167912699500508"
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 ;