Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746500797.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TCPcondis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746500797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 24K May 5 16:52 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-05-00
FORMULA_NAME TCPcondis-PT-05-01
FORMULA_NAME TCPcondis-PT-05-02
FORMULA_NAME TCPcondis-PT-05-03
FORMULA_NAME TCPcondis-PT-05-04
FORMULA_NAME TCPcondis-PT-05-05
FORMULA_NAME TCPcondis-PT-05-06
FORMULA_NAME TCPcondis-PT-05-07
FORMULA_NAME TCPcondis-PT-05-08
FORMULA_NAME TCPcondis-PT-05-09
FORMULA_NAME TCPcondis-PT-05-10
FORMULA_NAME TCPcondis-PT-05-11
FORMULA_NAME TCPcondis-PT-05-12
FORMULA_NAME TCPcondis-PT-05-13
FORMULA_NAME TCPcondis-PT-05-14
FORMULA_NAME TCPcondis-PT-05-15

=== Now, execution of the tool begins

BK_START 1621283089151

Running Version 0
[2021-05-17 20:24:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:24:50] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 20:24:50] [WARNING] Unknown XML tag in source file: size
[2021-05-17 20:24:50] [WARNING] Unknown XML tag in source file: color
[2021-05-17 20:24:50] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-17 20:24:50] [INFO ] Transformed 30 places.
[2021-05-17 20:24:50] [INFO ] Transformed 32 transitions.
[2021-05-17 20:24:50] [INFO ] Parsed PT model containing 30 places and 32 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:24:50] [INFO ] Initial state test concluded for 1 properties.
Support contains 24 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:50] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-17 20:24:50] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:51] [INFO ] Computed 9 place invariants in 7 ms
[2021-05-17 20:24:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:51] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 20:24:51] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 20:24:51] [INFO ] Flatten gal took : 24 ms
FORMULA TCPcondis-PT-05-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:24:51] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:24:51] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 401 steps, including 0 resets, run visited all 21 properties in 5 ms. (steps per millisecond=80 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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 17 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:24:51] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:51] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:24:51] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-17 20:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:24:51] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s16 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 356 ms.
Stack based approach found an accepted trace after 820 steps with 0 reset with depth 821 and stack size 453 in 11 ms.
FORMULA TCPcondis-PT-05-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-00 finished in 643 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (X(p0)&&p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : TCPcondis-PT-05-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s20 1)), p0:(OR (LT s11 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-01 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : TCPcondis-PT-05-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p2:(AND (OR (LT s4 1) (LT s21 1)) (LT s16 1)), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-02 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-03 finished in 147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s25 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31764 reset in 145 ms.
Product exploration explored 100000 steps with 31553 reset in 158 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31657 reset in 96 ms.
Product exploration explored 100000 steps with 31619 reset in 113 ms.
[2021-05-17 20:24:53] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:24:53] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:24:53] [INFO ] Time to serialize gal into /tmp/LTL12751755792771961781.gal : 1 ms
[2021-05-17 20:24:53] [INFO ] Time to serialize properties into /tmp/LTL2245114700592950319.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12751755792771961781.gal, -t, CGAL, -LTL, /tmp/LTL2245114700592950319.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12751755792771961781.gal -t CGAL -LTL /tmp/LTL2245114700592950319.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((X("(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))"))&&("(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))")))))
Formula 0 simplified : !GF("(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))" & X"(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))")
Reverse transition relation is NOT exact ! Due to transitions t8, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
201 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.02812,69868,1,0,71,280413,91,33,1155,273951,106
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TCPcondis-PT-05-04 finished in 3127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:55] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 20:24:55] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-05-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s19 1)), p1:(LT s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-05-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-06 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||F(!p1)) U G(!p1)))], workingDir=/home/mcc/execution]
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, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:55] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 20:24:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:24:55] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:55] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 23 ms :[p1]
Running random walk in product with property : TCPcondis-PT-05-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s15 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 187 ms.
Stack based approach found an accepted trace after 248 steps with 0 reset with depth 249 and stack size 249 in 1 ms.
FORMULA TCPcondis-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-07 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:56] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:56] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:24:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 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 1 rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:24:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:24:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
[2021-05-17 20:24:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:24:57] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:24:57] [INFO ] Time to serialize gal into /tmp/LTL17476803435847747313.gal : 1 ms
[2021-05-17 20:24:57] [INFO ] Time to serialize properties into /tmp/LTL2042069951375766581.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17476803435847747313.gal, -t, CGAL, -LTL, /tmp/LTL2042069951375766581.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17476803435847747313.gal -t CGAL -LTL /tmp/LTL2042069951375766581.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(CLOSED>=1)"))))
Formula 0 simplified : !XF"(CLOSED>=1)"
Reverse transition relation is NOT exact ! Due to transitions t8, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
145 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.46384,54664,1,0,63,215001,90,33,1116,183139,77
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TCPcondis-PT-05-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TCPcondis-PT-05-08 finished in 2702 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:58] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:58] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:58] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:24:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s19 1)), p0:(OR (GEQ s3 1) (AND (GEQ s2 1) (GEQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2067 reset in 180 ms.
Stack based approach found an accepted trace after 85025 steps with 1746 reset with depth 43 and stack size 43 in 164 ms.
FORMULA TCPcondis-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-09 finished in 509 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F(!p0))||(F(!p0)&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:24:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:24:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:24:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TCPcondis-PT-05-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1502 reset in 166 ms.
Product exploration explored 100000 steps with 1522 reset in 177 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1499 reset in 164 ms.
Product exploration explored 100000 steps with 1474 reset in 176 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:25:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:25:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 1662 reset in 312 ms.
Product exploration explored 100000 steps with 1625 reset in 244 ms.
[2021-05-17 20:25:01] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:25:01] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:25:01] [INFO ] Time to serialize gal into /tmp/LTL3647230847214338553.gal : 1 ms
[2021-05-17 20:25:01] [INFO ] Time to serialize properties into /tmp/LTL8846231223302271438.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3647230847214338553.gal, -t, CGAL, -LTL, /tmp/LTL8846231223302271438.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3647230847214338553.gal -t CGAL -LTL /tmp/LTL8846231223302271438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((FINWAIT2<1)||(xFIN<1))")))||((F("((FINWAIT2<1)||(xFIN<1))"))&&(F(G("(CLOSED>=1)"))))))))
Formula 0 simplified : !XX(GF"((FINWAIT2<1)||(xFIN<1))" | (F"((FINWAIT2<1)||(xFIN<1))" & FG"(CLOSED>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t8, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
255 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.56263,87524,1,0,87,377424,105,50,1155,413047,153
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TCPcondis-PT-05-10 finished in 4911 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:04] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : TCPcondis-PT-05-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s6 1) (LT s20 1)), p0:(AND (GEQ s9 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 47 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-11 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0) U X((p1 U (G(p2) U p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:04] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:04] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (NOT p3), p0, (AND p0 (NOT p2)), (AND p0 p1 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-05-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s27 1)), p3:(GEQ s15 1), p2:(GEQ s14 1), p1:(OR (LT s4 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Knowledge obtained : [p0, p3, (NOT p2), p1]
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (NOT p3), p0, (AND p0 (NOT p2)), (AND p0 p1 (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3) (NOT p1)), (NOT p3), p0, (AND p0 (NOT p2)), (AND p0 p1 (NOT p3))]
Support contains 6 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 20:25:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:05] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
[2021-05-17 20:25:05] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:25:05] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:25:05] [INFO ] Time to serialize gal into /tmp/LTL12114706154799270831.gal : 2 ms
[2021-05-17 20:25:05] [INFO ] Time to serialize properties into /tmp/LTL1593534864177650560.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12114706154799270831.gal, -t, CGAL, -LTL, /tmp/LTL1593534864177650560.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12114706154799270831.gal -t CGAL -LTL /tmp/LTL1593534864177650560.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((SYNACK>=1)&&(xSYNRCVD>=1))"))U(X(("((FIN<1)||(xFINWAIT1<1))")U((G("(TIMEWAIT>=1)"))U("(xCLOSED>=1)"))))))
Formula 0 simplified : !(F"((SYNACK>=1)&&(xSYNRCVD>=1))" U X("((FIN<1)||(xFINWAIT1<1))" U (G"(TIMEWAIT>=1)" U "(xCLOSED>=1)")))
Reverse transition relation is NOT exact ! Due to transitions t8, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
147 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48053,56720,1,0,63,215001,108,33,1136,183141,83
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TCPcondis-PT-05-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TCPcondis-PT-05-12 finished in 3074 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 3 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-17 20:25:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 25 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s21 1) (LT s22 1)) (OR (LT s4 1) (LT s15 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 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA TCPcondis-PT-05-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-13 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G((F((G(!p0)||(!p0&&F(p1)))) U !p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
Applied a total of 8 rules in 3 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:07] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-17 20:25:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 20:25:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:07] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 28/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : TCPcondis-PT-05-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s12 1), p1:(OR (LT s11 1) (LT s21 1) (LT s22 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 5678 reset in 161 ms.
Stack based approach found an accepted trace after 45047 steps with 2581 reset with depth 30 and stack size 30 in 77 ms.
FORMULA TCPcondis-PT-05-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-14 finished in 391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||X((p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 20:25:08] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:08] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:08] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:25:08] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:25:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s15 1), p1:(GEQ s1 1), p2:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2318 reset in 151 ms.
Product exploration explored 100000 steps with 2326 reset in 164 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 2332 reset in 152 ms.
Product exploration explored 100000 steps with 2325 reset in 166 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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 1 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 20:25:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 20:25:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:25:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 2477 reset in 171 ms.
Product exploration explored 100000 steps with 2491 reset in 182 ms.
[2021-05-17 20:25:09] [INFO ] Flatten gal took : 2 ms
[2021-05-17 20:25:09] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:25:09] [INFO ] Time to serialize gal into /tmp/LTL14386867671921254832.gal : 1 ms
[2021-05-17 20:25:09] [INFO ] Time to serialize properties into /tmp/LTL2478655130469019815.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14386867671921254832.gal, -t, CGAL, -LTL, /tmp/LTL2478655130469019815.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14386867671921254832.gal -t CGAL -LTL /tmp/LTL2478655130469019815.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(xCLOSED>=1)"))||(X(("(CLOSEWAIT>=1)")&&(G("(((ESTAB>=1)&&(FIN>=1))&&(xESTAB>=1))")))))))
Formula 0 simplified : !G(F"(xCLOSED>=1)" | X("(CLOSEWAIT>=1)" & G"(((ESTAB>=1)&&(FIN>=1))&&(xESTAB>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t8, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
471 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.73564,150228,1,0,246,741304,104,35,1154,721824,542
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TCPcondis-PT-05-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TCPcondis-PT-05-15 finished in 6844 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621283116021

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05"
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-4028"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-05, 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 r254-tall-162106746500797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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