Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.4K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 24K May 10 09:34 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-40-LTLFireability-00
FORMULA_NAME TCPcondis-PT-40-LTLFireability-01
FORMULA_NAME TCPcondis-PT-40-LTLFireability-02
FORMULA_NAME TCPcondis-PT-40-LTLFireability-03
FORMULA_NAME TCPcondis-PT-40-LTLFireability-04
FORMULA_NAME TCPcondis-PT-40-LTLFireability-05
FORMULA_NAME TCPcondis-PT-40-LTLFireability-06
FORMULA_NAME TCPcondis-PT-40-LTLFireability-07
FORMULA_NAME TCPcondis-PT-40-LTLFireability-08
FORMULA_NAME TCPcondis-PT-40-LTLFireability-09
FORMULA_NAME TCPcondis-PT-40-LTLFireability-10
FORMULA_NAME TCPcondis-PT-40-LTLFireability-11
FORMULA_NAME TCPcondis-PT-40-LTLFireability-12
FORMULA_NAME TCPcondis-PT-40-LTLFireability-13
FORMULA_NAME TCPcondis-PT-40-LTLFireability-14
FORMULA_NAME TCPcondis-PT-40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653147700732

Running Version 202205111006
[2022-05-21 15:41:41] [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]
[2022-05-21 15:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 15:41:41] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 15:41:41] [WARNING] Unknown XML tag in source file: size
[2022-05-21 15:41:41] [WARNING] Unknown XML tag in source file: color
[2022-05-21 15:41:41] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2022-05-21 15:41:41] [INFO ] Transformed 30 places.
[2022-05-21 15:41:41] [INFO ] Transformed 32 transitions.
[2022-05-21 15:41:41] [INFO ] Parsed PT model containing 30 places and 32 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TCPcondis-PT-40-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:42] [INFO ] Computed 9 place invariants in 9 ms
[2022-05-21 15:41:42] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:42] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:42] [INFO ] Computed 9 place invariants in 7 ms
[2022-05-21 15:41:42] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 22 out of 30 places after structural reductions.
[2022-05-21 15:41:42] [INFO ] Flatten gal took : 22 ms
[2022-05-21 15:41:42] [INFO ] Flatten gal took : 8 ms
[2022-05-21 15:41:42] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 21) seen :20
Finished Best-First random walk after 63 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(p1)||p2))&&X(p3)&&p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:42] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:43] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s28 1)), p2:(AND (GEQ s10 1) (GEQ s28 1)), p1:(AND (GEQ s6 1) (GEQ s19 1)), p3:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2693 reset in 274 ms.
Stack based approach found an accepted trace after 85433 steps with 2245 reset with depth 21 and stack size 21 in 181 ms.
FORMULA TCPcondis-PT-40-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-00 finished in 924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !(G(X(p1))&&F(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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:43] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND p1 p0), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s1 1), p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 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 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 p1))))
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-40-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-01 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:44] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:44] [INFO ] Implicit Places using invariants and state equation in 32 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
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:44] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s8 1) (LT s20 1)), p0:(OR (LT s3 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 141 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-02 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1) U G((!G(!G(p0))&&X(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
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:44] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:44] [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.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s19 1)), p0:(AND (GEQ s5 1) (GEQ s23 1)), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 0 reset in 311 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) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 584 ms. Reduced automaton from 8 states, 19 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Finished random walk after 4265 steps, including 1 resets, run visited all 12 properties in 18 ms. (steps per millisecond=236 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT p2)), (F p1), (F (NOT (AND p2 (NOT p0)))), (F (AND p2 p0 (NOT p1))), (F (AND p2 p1))]
Knowledge based reduction with 12 factoid took 806 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:47] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 15:41:47] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 15:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 15:41:48] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 15:41:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:41:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 15:41:48] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 15:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-21 15:41:48] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 15:41:48] [INFO ] Added : 28 causal constraints over 6 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:48] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:48] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:48] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:48] [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.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:48] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p2 (NOT p0) (NOT p1)), (X (X (AND p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :11
Finished Best-First random walk after 577 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=288 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT p2)), (F p1), (F (NOT (AND p2 (NOT p0)))), (F (AND p2 p0 (NOT p1))), (F (AND p2 p1))]
Knowledge based reduction with 6 factoid took 560 ms. Reduced automaton from 8 states, 17 edges and 3 AP to 8 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:49] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-21 15:41:49] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-21 15:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 15:41:49] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 15:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:41:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 15:41:49] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 15:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-21 15:41:49] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 15:41:50] [INFO ] Added : 28 causal constraints over 6 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (AND p1 (NOT p2)), true, (NOT p0), (AND p1 p2)]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 30 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 4 place count 30 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 30 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 5 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 31/32 (removed 1) transitions.
[2022-05-21 15:41:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 30 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 7 ms
[2022-05-21 15:41:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 31/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 22170 steps with 0 reset with depth 22171 and stack size 19351 in 51 ms.
FORMULA TCPcondis-PT-40-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-05 finished in 6814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U p1)))'
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 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Applied a total of 6 rules in 5 ms. Remains 28 /30 variables (removed 2) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 28 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:51] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-21 15:41:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 28/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 28/32 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s14 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4090 steps with 0 reset in 14 ms.
FORMULA TCPcondis-PT-40-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-06 finished in 249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G(p1)&&F(!X(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
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:51] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:41:51] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, (NOT p1), p2, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-07 automaton TGBA Formula[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 p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s24 1), p1:(GEQ s0 1), p2:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 544 steps with 1 reset in 1 ms.
FORMULA TCPcondis-PT-40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-07 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)||(G(p1)&&p2)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 15:41:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-21 15:41:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s18 1)), p2:(OR (LT s5 1) (LT s15 1)), p1:(OR (LT s10 1) (LT s18 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 4485 reset in 171 ms.
Stack based approach found an accepted trace after 24908 steps with 1145 reset with depth 81 and stack size 81 in 44 ms.
FORMULA TCPcondis-PT-40-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-08 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 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 10 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:52] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-21 15:41:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 15:41:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s6 1) (GEQ s16 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2141 reset in 168 ms.
Stack based approach found an accepted trace after 7075 steps with 146 reset with depth 12 and stack size 12 in 14 ms.
FORMULA TCPcondis-PT-40-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-10 finished in 419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U X(G(F((p1 U p2))))))||G(p0)||p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 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 15 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:53] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-21 15:41:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s11 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21606 reset in 79 ms.
Product exploration explored 100000 steps with 21601 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1190 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=595 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 15:41:53] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 15:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 15:41:53] [INFO ] Computed and/alt/rep : 21/81/21 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-21 15:41:53] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:54] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:54] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:41:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-21 15:41:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:54] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 24/24 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) (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2625 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=875 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:41:54] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:41:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 15:41:54] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-21 15:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:41:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 15:41:54] [INFO ] Computed and/alt/rep : 21/81/21 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 15:41:54] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 21527 reset in 76 ms.
Product exploration explored 100000 steps with 21443 reset in 83 ms.
Built C files in :
/tmp/ltsmin15092731383054592989
[2022-05-21 15:41:55] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2022-05-21 15:41:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:41:55] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2022-05-21 15:41:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:41:55] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2022-05-21 15:41:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:41:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15092731383054592989
Running compilation step : cd /tmp/ltsmin15092731383054592989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin15092731383054592989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15092731383054592989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3732047838097052074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:42:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:42:10] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:42:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:42:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-21 15:42:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 15:42:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:42:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 24/24 transitions.
Built C files in :
/tmp/ltsmin5403819278076327194
[2022-05-21 15:42:10] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2022-05-21 15:42:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:42:10] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2022-05-21 15:42:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:42:10] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2022-05-21 15:42:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:42:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5403819278076327194
Running compilation step : cd /tmp/ltsmin5403819278076327194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin5403819278076327194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5403819278076327194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9502925149312160074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 15:42:25] [INFO ] Flatten gal took : 3 ms
[2022-05-21 15:42:25] [INFO ] Flatten gal took : 4 ms
[2022-05-21 15:42:25] [INFO ] Time to serialize gal into /tmp/LTL16434879209881065350.gal : 1 ms
[2022-05-21 15:42:25] [INFO ] Time to serialize properties into /tmp/LTL8983904481485067159.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16434879209881065350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8983904481485067159.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1643487...267
Read 1 LTL properties
Checking formula 0 : !((F(((F(("((LISTEN>=1)&&(xSYN>=1))")U(X(G(F(("(LISTEN>=1)")U("((SYNSENT>=1)&&(xSYN>=1))")))))))||(G("((LISTEN>=1)&&(xSYN>=1))")))||("...184
Formula 0 simplified : !F("((LISTEN>=1)&&(xSYN>=1))" | F("((LISTEN>=1)&&(xSYN>=1))" U XGF("(LISTEN>=1)" U "((SYNSENT>=1)&&(xSYN>=1))")) | G"((LISTEN>=1)&&(...166
Detected timeout of ITS tools.
[2022-05-21 15:42:40] [INFO ] Flatten gal took : 8 ms
[2022-05-21 15:42:40] [INFO ] Applying decomposition
[2022-05-21 15:42:40] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11167742258640960918.txt' '-o' '/tmp/graph11167742258640960918.bin' '-w' '/tmp/graph11167742258640960918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11167742258640960918.bin' '-l' '-1' '-v' '-w' '/tmp/graph11167742258640960918.weights' '-q' '0' '-e' '0.001'
[2022-05-21 15:42:40] [INFO ] Decomposing Gal with order
[2022-05-21 15:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 15:42:40] [INFO ] Removed a total of 23 redundant transitions.
[2022-05-21 15:42:40] [INFO ] Flatten gal took : 27 ms
[2022-05-21 15:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-21 15:42:40] [INFO ] Time to serialize gal into /tmp/LTL8329613310974599380.gal : 2 ms
[2022-05-21 15:42:40] [INFO ] Time to serialize properties into /tmp/LTL11689942965805707504.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8329613310974599380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11689942965805707504.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8329613...246
Read 1 LTL properties
Checking formula 0 : !((F(((F(("((u3.LISTEN>=1)&&(i2.u4.xSYN>=1))")U(X(G(F(("(u3.LISTEN>=1)")U("((u3.SYNSENT>=1)&&(i2.u4.xSYN>=1))")))))))||(G("((u3.LISTEN...223
Formula 0 simplified : !F("((u3.LISTEN>=1)&&(i2.u4.xSYN>=1))" | F("((u3.LISTEN>=1)&&(i2.u4.xSYN>=1))" U XGF("(u3.LISTEN>=1)" U "((u3.SYNSENT>=1)&&(i2.u4.xS...205
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7103903865925334640
[2022-05-21 15:42:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7103903865925334640
Running compilation step : cd /tmp/ltsmin7103903865925334640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin7103903865925334640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7103903865925334640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-40-LTLFireability-11 finished in 77673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0))) U G(p1))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 10 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:10] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-21 15:43:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s14 1)), p0:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 249 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 p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Finished random walk after 698 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=232 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 15:43:11] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-21 15:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:43:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 15:43:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:43:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-21 15:43:11] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-21 15:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:43:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-21 15:43:11] [INFO ] Computed and/alt/rep : 23/80/23 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 15:43:11] [INFO ] Added : 19 causal constraints over 5 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:11] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:11] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-21 15:43:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Finished random walk after 657 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=328 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 15:43:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:12] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-21 15:43:12] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-21 15:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:43:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 15:43:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:43:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-21 15:43:12] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-21 15:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:43:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-21 15:43:12] [INFO ] Computed and/alt/rep : 23/80/23 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 15:43:12] [INFO ] Added : 19 causal constraints over 5 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 12575 steps with 0 reset with depth 12576 and stack size 12575 in 27 ms.
FORMULA TCPcondis-PT-40-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-12 finished in 2215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(!p0))))'
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.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:12] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:12] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s6 1) (GEQ s19 1)), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-14 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:13] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:13] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 15:43:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 15:43:13] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 15:43:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p0:(AND (GEQ s9 1) (GEQ s25 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-15 finished in 212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U X(G(F((p1 U p2))))))||G(p0)||p0)))'
[2022-05-21 15:43:13] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9628702280515671820
[2022-05-21 15:43:13] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-21 15:43:13] [INFO ] Applying decomposition
[2022-05-21 15:43:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:43:13] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-21 15:43:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:43:13] [INFO ] Flatten gal took : 2 ms
[2022-05-21 15:43:13] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-21 15:43:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:43:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9628702280515671820
Running compilation step : cd /tmp/ltsmin9628702280515671820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17344250133022446021.txt' '-o' '/tmp/graph17344250133022446021.bin' '-w' '/tmp/graph17344250133022446021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17344250133022446021.bin' '-l' '-1' '-v' '-w' '/tmp/graph17344250133022446021.weights' '-q' '0' '-e' '0.001'
[2022-05-21 15:43:13] [INFO ] Decomposing Gal with order
[2022-05-21 15:43:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 15:43:13] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-21 15:43:13] [INFO ] Flatten gal took : 4 ms
[2022-05-21 15:43:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 15:43:13] [INFO ] Time to serialize gal into /tmp/LTLFireability11159414375691913743.gal : 2 ms
[2022-05-21 15:43:13] [INFO ] Time to serialize properties into /tmp/LTLFireability12064248196006007600.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11159414375691913743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12064248196006007600.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((F(((F(("((u4.LISTEN>=1)&&(u6.xSYN>=1))")U(X(G(F(("(u4.LISTEN>=1)")U("((u4.SYNSENT>=1)&&(u6.xSYN>=1))")))))))||(G("((u4.LISTEN>=1)&&...211
Formula 0 simplified : !F("((u4.LISTEN>=1)&&(u6.xSYN>=1))" | F("((u4.LISTEN>=1)&&(u6.xSYN>=1))" U XGF("(u4.LISTEN>=1)" U "((u4.SYNSENT>=1)&&(u6.xSYN>=1))")...193
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin9628702280515671820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9628702280515671820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: LTL layer: formula: <>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.001: "<>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.077: DFS-FIFO for weak LTL, using special progress label 36
pins2lts-mc-linux64( 0/ 8), 0.077: There are 37 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.077: State length is 31, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.077: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.077: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.077: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.077: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.091: ~61 levels ~960 states ~2568 transitions
pins2lts-mc-linux64( 6/ 8), 0.094: ~61 levels ~1920 states ~3816 transitions
pins2lts-mc-linux64( 1/ 8), 0.109: ~52 levels ~3840 states ~6936 transitions
pins2lts-mc-linux64( 1/ 8), 0.132: ~52 levels ~7680 states ~13680 transitions
pins2lts-mc-linux64( 6/ 8), 0.183: ~88 levels ~15360 states ~34760 transitions
pins2lts-mc-linux64( 6/ 8), 0.263: ~88 levels ~30720 states ~75056 transitions
pins2lts-mc-linux64( 1/ 8), 0.412: ~91 levels ~61440 states ~164016 transitions
pins2lts-mc-linux64( 0/ 8), 0.701: ~94 levels ~122880 states ~347128 transitions
pins2lts-mc-linux64( 5/ 8), 1.050: ~95 levels ~245760 states ~609464 transitions
pins2lts-mc-linux64( 5/ 8), 1.678: ~95 levels ~491520 states ~1139032 transitions
pins2lts-mc-linux64( 5/ 8), 2.875: ~108 levels ~983040 states ~2379672 transitions
pins2lts-mc-linux64( 5/ 8), 4.931: ~109 levels ~1966080 states ~4993488 transitions
pins2lts-mc-linux64( 5/ 8), 7.968: ~109 levels ~3932160 states ~10560792 transitions
pins2lts-mc-linux64( 5/ 8), 12.391: ~109 levels ~7864320 states ~21431920 transitions
pins2lts-mc-linux64( 5/ 8), 19.775: ~109 levels ~15728640 states ~43441584 transitions
pins2lts-mc-linux64( 5/ 8), 34.584: ~109 levels ~31457280 states ~88682552 transitions
pins2lts-mc-linux64( 5/ 8), 66.391: ~118 levels ~62914560 states ~188326320 transitions
pins2lts-mc-linux64( 5/ 8), 135.044: ~118 levels ~125829120 states ~399798984 transitions
pins2lts-mc-linux64( 3/ 8), 190.779: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 190.794:
pins2lts-mc-linux64( 0/ 8), 190.794: mean standard work distribution: 8.0% (states) 5.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 190.795:
pins2lts-mc-linux64( 0/ 8), 190.795: Explored 134406294 states 461096097 transitions, fanout: 3.431
pins2lts-mc-linux64( 0/ 8), 190.795: Total exploration time 190.710 sec (190.690 sec minimum, 190.701 sec on average)
pins2lts-mc-linux64( 0/ 8), 190.795: States per second: 704768, Transitions per second: 2417786
pins2lts-mc-linux64( 0/ 8), 190.795:
pins2lts-mc-linux64( 0/ 8), 190.795: Progress states detected: 16175
pins2lts-mc-linux64( 0/ 8), 190.795: Redundant explorations: 0.1410
pins2lts-mc-linux64( 0/ 8), 190.795:
pins2lts-mc-linux64( 0/ 8), 190.795: Queue width: 8B, total height: 14895, memory: 0.11MB
pins2lts-mc-linux64( 0/ 8), 190.795: Tree memory: 1217.3MB, 9.5 B/state, compr.: 7.5%
pins2lts-mc-linux64( 0/ 8), 190.795: Tree fill ratio (roots/leafs): 99.0%/75.0%
pins2lts-mc-linux64( 0/ 8), 190.795: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 190.795: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 190.795: Est. total memory use: 1217.4MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9628702280515671820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9628702280515671820;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>(((LTLAPp0==true) U X([](<>(((LTLAPp1==true) U (LTLAPp2==true)))))))||[]((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 16:03:43] [INFO ] Flatten gal took : 6 ms
[2022-05-21 16:03:43] [INFO ] Time to serialize gal into /tmp/LTLFireability11059500789066519704.gal : 1 ms
[2022-05-21 16:03:43] [INFO ] Time to serialize properties into /tmp/LTLFireability3387455007234048180.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11059500789066519704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3387455007234048180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((F(((F(("((LISTEN>=1)&&(xSYN>=1))")U(X(G(F(("(LISTEN>=1)")U("((SYNSENT>=1)&&(xSYN>=1))")))))))||(G("((LISTEN>=1)&&(xSYN>=1))")))||("...184
Formula 0 simplified : !F("((LISTEN>=1)&&(xSYN>=1))" | F("((LISTEN>=1)&&(xSYN>=1))" U XGF("(LISTEN>=1)" U "((SYNSENT>=1)&&(xSYN>=1))")) | G"((LISTEN>=1)&&(...166
Detected timeout of ITS tools.
[2022-05-21 16:24:19] [INFO ] Flatten gal took : 128 ms
[2022-05-21 16:24:20] [INFO ] Input system was already deterministic with 32 transitions.
[2022-05-21 16:24:20] [INFO ] Transformed 30 places.
[2022-05-21 16:24:20] [INFO ] Transformed 32 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 16:24:20] [INFO ] Time to serialize gal into /tmp/LTLFireability11225485093392212413.gal : 3 ms
[2022-05-21 16:24:20] [INFO ] Time to serialize properties into /tmp/LTLFireability308035054827553773.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11225485093392212413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability308035054827553773.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((F(("((LISTEN>=1)&&(xSYN>=1))")U(X(G(F(("(LISTEN>=1)")U("((SYNSENT>=1)&&(xSYN>=1))")))))))||(G("((LISTEN>=1)&&(xSYN>=1))")))||("...184
Formula 0 simplified : !F("((LISTEN>=1)&&(xSYN>=1))" | F("((LISTEN>=1)&&(xSYN>=1))" U XGF("(LISTEN>=1)" U "((SYNSENT>=1)&&(xSYN>=1))")) | G"((LISTEN>=1)&&(...166

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-40"
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-40, 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 r258-tall-165303545800500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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