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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 8.9K Apr 29 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 12:56 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 3.7K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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-25-LTLFireability-00
FORMULA_NAME TCPcondis-PT-25-LTLFireability-01
FORMULA_NAME TCPcondis-PT-25-LTLFireability-02
FORMULA_NAME TCPcondis-PT-25-LTLFireability-03
FORMULA_NAME TCPcondis-PT-25-LTLFireability-04
FORMULA_NAME TCPcondis-PT-25-LTLFireability-05
FORMULA_NAME TCPcondis-PT-25-LTLFireability-06
FORMULA_NAME TCPcondis-PT-25-LTLFireability-07
FORMULA_NAME TCPcondis-PT-25-LTLFireability-08
FORMULA_NAME TCPcondis-PT-25-LTLFireability-09
FORMULA_NAME TCPcondis-PT-25-LTLFireability-10
FORMULA_NAME TCPcondis-PT-25-LTLFireability-11
FORMULA_NAME TCPcondis-PT-25-LTLFireability-12
FORMULA_NAME TCPcondis-PT-25-LTLFireability-13
FORMULA_NAME TCPcondis-PT-25-LTLFireability-14
FORMULA_NAME TCPcondis-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653142419716

Running Version 202205111006
[2022-05-21 14:13:40] [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 14:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 14:13:40] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 14:13:40] [WARNING] Unknown XML tag in source file: size
[2022-05-21 14:13:40] [WARNING] Unknown XML tag in source file: color
[2022-05-21 14:13:41] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-05-21 14:13:41] [INFO ] Transformed 30 places.
[2022-05-21 14:13:41] [INFO ] Transformed 32 transitions.
[2022-05-21 14:13:41] [INFO ] Parsed PT model containing 30 places and 32 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TCPcondis-PT-25-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 14:13:41] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-21 14:13:41] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:41] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-21 14:13:41] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:41] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 14:13:41] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 23 out of 30 places after structural reductions.
[2022-05-21 14:13:41] [INFO ] Flatten gal took : 25 ms
[2022-05-21 14:13:41] [INFO ] Flatten gal took : 6 ms
[2022-05-21 14:13:41] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 970 steps, including 0 resets, run visited all 22 properties in 21 ms. (steps per millisecond=46 )
FORMULA TCPcondis-PT-25-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(((p0 U G(!G(p0))) U ((F(p0)&&p1) U X(!p2))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:42] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:42] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 14:13:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:42] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 14:13:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 332 ms :[p2, (AND p0 p2), p2, p0, p0]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s25 1)), p0:(AND (GEQ s5 1) (GEQ s23 1)), p2:(AND (GEQ s2 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-25-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLFireability-00 finished in 960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p2 U p3)&&p1))||G(p3)||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 14:13:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:43] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:43] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-21 14:13:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:13:43] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 14:13:43] [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 316 ms :[true, (OR (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=3, aps=[p3:(GEQ s15 1), p2:(AND (GEQ s10 1) (GEQ s28 1)), p1:(AND (GEQ s10 1) (GEQ s28 1)), p0:(OR (LT s10 1) (LT s11 1) (LT s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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 p3 (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (OR (AND (NOT p3) (NOT p2)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p3) (NOT p2)) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p3)))
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 7 states, 13 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-25-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLFireability-01 finished in 820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F(G((!p0 U 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: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 17 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:43] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-21 14:13:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s11 1), p1:(AND (GEQ s5 1) (GEQ s16 1)), p0:(AND (GEQ s4 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 8 reset in 284 ms.
Product exploration explored 100000 steps with 8 reset in 343 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 911 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=303 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:13:45] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:45] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:13:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-21 14:13:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:13:45] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:13:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 625 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=312 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13 reset in 218 ms.
Product exploration explored 100000 steps with 10 reset in 232 ms.
Built C files in :
/tmp/ltsmin18390305126129279005
[2022-05-21 14:13:47] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-05-21 14:13:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:13:47] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-05-21 14:13:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:13:47] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-05-21 14:13:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:13:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18390305126129279005
Running compilation step : cd /tmp/ltsmin18390305126129279005;'/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 200 ms.
Running link step : cd /tmp/ltsmin18390305126129279005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18390305126129279005;'/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/stateBased576789424166085220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:14:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:14:02] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:14:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:14:02] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 14:14:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 14:14:02] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:14:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 26/26 transitions.
Built C files in :
/tmp/ltsmin15697175303393670813
[2022-05-21 14:14:02] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-05-21 14:14:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:14:02] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-05-21 14:14:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:14:02] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-05-21 14:14:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:14:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15697175303393670813
Running compilation step : cd /tmp/ltsmin15697175303393670813;'/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 89 ms.
Running link step : cd /tmp/ltsmin15697175303393670813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin15697175303393670813;'/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/stateBased3833689548111891906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 14:14:17] [INFO ] Flatten gal took : 4 ms
[2022-05-21 14:14:17] [INFO ] Flatten gal took : 3 ms
[2022-05-21 14:14:17] [INFO ] Time to serialize gal into /tmp/LTL871387057659270862.gal : 1 ms
[2022-05-21 14:14:17] [INFO ] Time to serialize properties into /tmp/LTL3213539969411714559.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/LTL871387057659270862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3213539969411714559.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/LTL8713870...265
Read 1 LTL properties
Checking formula 0 : !((G(X(F((F(G((!("((FINACK>=1)&&(xLASTACK>=1))"))U("((FINWAIT1>=1)&&(xFINACK>=1))"))))||("(xCLOSED>=1)"))))))
Formula 0 simplified : !GXF("(xCLOSED>=1)" | FG(!"((FINACK>=1)&&(xLASTACK>=1))" U "((FINWAIT1>=1)&&(xFINACK>=1))"))
Detected timeout of ITS tools.
[2022-05-21 14:14:32] [INFO ] Flatten gal took : 3 ms
[2022-05-21 14:14:32] [INFO ] Applying decomposition
[2022-05-21 14:14:32] [INFO ] Flatten gal took : 3 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/graph421053468896139933.txt' '-o' '/tmp/graph421053468896139933.bin' '-w' '/tmp/graph421053468896139933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph421053468896139933.bin' '-l' '-1' '-v' '-w' '/tmp/graph421053468896139933.weights' '-q' '0' '-e' '0.001'
[2022-05-21 14:14:32] [INFO ] Decomposing Gal with order
[2022-05-21 14:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 14:14:32] [INFO ] Removed a total of 15 redundant transitions.
[2022-05-21 14:14:32] [INFO ] Flatten gal took : 38 ms
[2022-05-21 14:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-21 14:14:32] [INFO ] Time to serialize gal into /tmp/LTL8568089992895338788.gal : 2 ms
[2022-05-21 14:14:32] [INFO ] Time to serialize properties into /tmp/LTL5573217305051105587.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/LTL8568089992895338788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5573217305051105587.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/LTL8568089...245
Read 1 LTL properties
Checking formula 0 : !((G(X(F((F(G((!("((i1.u3.FINACK>=1)&&(i3.u7.xLASTACK>=1))"))U("((i0.u1.FINWAIT1>=1)&&(i0.u5.xFINACK>=1))"))))||("(i1.u3.xCLOSED>=1)")...160
Formula 0 simplified : !GXF("(i1.u3.xCLOSED>=1)" | FG(!"((i1.u3.FINACK>=1)&&(i3.u7.xLASTACK>=1))" U "((i0.u1.FINWAIT1>=1)&&(i0.u5.xFINACK>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5811263276245030849
[2022-05-21 14:14:47] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5811263276245030849
Running compilation step : cd /tmp/ltsmin5811263276245030849;'/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 89 ms.
Running link step : cd /tmp/ltsmin5811263276245030849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5811263276245030849;'/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' '[](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-25-LTLFireability-02 finished in 79127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||G(p1)||F(p2))) U G(p3)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:03] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 14:15:03] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:03] [INFO ] Implicit Places using invariants and state equation in 36 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
[2022-05-21 14:15:03] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:03] [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.
Stuttering acceptance computed with spot in 405 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=10 dest: 8}, { cond=(AND p3 (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 9}, { cond=(AND p3 p1 (NOT p2) p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s20 1)), p1:(GEQ s9 1), p2:(AND (GEQ s10 1) (GEQ s28 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14812 reset in 98 ms.
Product exploration explored 100000 steps with 14776 reset in 98 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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 10 factoid took 1093 ms. Reduced automaton from 11 states, 28 edges and 4 AP to 11 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 361 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 23) seen :21
Finished Best-First random walk after 8361 steps, including 2 resets, run visited all 2 properties in 19 ms. (steps per millisecond=440 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1 (NOT p2))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) p3 p1)), (F (AND (NOT p2) (NOT p3) p1)), (F (AND (NOT p0) (NOT p2) p3 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p3) p1)), (F (AND (NOT p2) p3 p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p2) p3 (NOT p1))), (F (AND p0 (NOT p2) (NOT p3) (NOT p1))), (F p3), (F (AND (NOT p2) p3)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) p3)), (F (AND p0 (NOT p2) p3 p1)), (F (AND p0 (NOT p2) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (AND p0 (NOT p2) (NOT p3) p1))]
Knowledge based reduction with 10 factoid took 1596 ms. Reduced automaton from 11 states, 28 edges and 4 AP to 11 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 370 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Stuttering acceptance computed with spot in 425 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:07] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 14:15:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 14:15:07] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 14:15:07] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-21 14:15:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:07] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 14:15:07] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:07] [INFO ] Added : 22 causal constraints over 5 iterations in 48 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:07] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:07] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:07] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:08] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:08] [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 (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 1155 ms. Reduced automaton from 11 states, 28 edges and 4 AP to 11 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 423 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Finished Best-First random walk after 319 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=159 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p3) p1)), (X (NOT (AND (NOT p2) (NOT p3) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) p3 (NOT p0))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) p3 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) (NOT p3) p0)), (F p3), (F (AND (NOT p2) p3)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p1 (NOT p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p3 (NOT p0))), (F (AND p1 (NOT p2) p3 p0)), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p3 p0)), (F (AND p1 (NOT p2) (NOT p3) p0))]
Knowledge based reduction with 10 factoid took 1688 ms. Reduced automaton from 11 states, 28 edges and 4 AP to 11 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 372 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:12] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 14:15:12] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 14:15:12] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 14:15:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:12] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-21 14:15:12] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:12] [INFO ] Added : 22 causal constraints over 5 iterations in 28 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 437 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Product exploration explored 100000 steps with 14845 reset in 91 ms.
Product exploration explored 100000 steps with 14709 reset in 97 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 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 0 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 1 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 13 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2022-05-21 14:15:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 14:15:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 14361 reset in 158 ms.
Stack based approach found an accepted trace after 89151 steps with 12806 reset with depth 15 and stack size 12 in 142 ms.
FORMULA TCPcondis-PT-25-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-05 finished in 10788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((F(G(p0))&&G(p1))))&&p2)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 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 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 25 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 25 transition count 25
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 13 place count 24 transition count 25
Applied a total of 13 rules in 11 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 14:15:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:13] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 14:15:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-21 14:15:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 14:15:13] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 14:15:13] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s13 1), p1:(AND (GEQ s5 1) (GEQ s16 1)), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 198 ms.
Stack based approach found an accepted trace after 32779 steps with 0 reset with depth 32780 and stack size 32780 in 68 ms.
FORMULA TCPcondis-PT-25-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-06 finished in 633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(F((X(X(p1)) U p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 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 14:15:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:14] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:14] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 14:15:14] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:14] [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 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15496 reset in 74 ms.
Product exploration explored 100000 steps with 15379 reset in 78 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:15] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 14:15:15] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 14:15:15] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 14:15:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:15] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 14:15:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-21 14:15:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 14:15:15] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 24/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 24 rows 23 cols
[2022-05-21 14:15:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 14:15:15] [INFO ] Computed and/alt/rep : 21/81/21 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:15] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19495 reset in 63 ms.
Product exploration explored 100000 steps with 19496 reset in 72 ms.
Built C files in :
/tmp/ltsmin6962627748354536764
[2022-05-21 14:15:15] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2022-05-21 14:15:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:15] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2022-05-21 14:15:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:15] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2022-05-21 14:15:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6962627748354536764
Running compilation step : cd /tmp/ltsmin6962627748354536764;'/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 93 ms.
Running link step : cd /tmp/ltsmin6962627748354536764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6962627748354536764;'/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/stateBased5504469136333117392.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA TCPcondis-PT-25-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLFireability-08 finished in 1669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U F(p1))||F(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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 3 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 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-21 14:15:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s23 1), p1:(AND (GEQ s5 1) (GEQ s15 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][true]]
Product exploration explored 100000 steps with 3799 reset in 134 ms.
Stack based approach found an accepted trace after 36040 steps with 1352 reset with depth 29 and stack size 29 in 55 ms.
FORMULA TCPcondis-PT-25-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-09 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p0)))||(X(p1)&&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 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(OR (LT s13 1) (LT s25 1)), p1:(OR (LT s3 1) (LT s19 1)), p0:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-10 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))||(G(p1)&&F(p2))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 29 transition count 31
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 29 transition count 29
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 29 transition count 28
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 6 place count 28 transition count 28
Applied a total of 6 rules in 3 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 14:15:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-21 14:15:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2022-05-21 14:15:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:16] [INFO ] Dead Transitions using invariants and state equation in 24 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 87 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s13 1) (AND (GEQ s8 1) (GEQ s18 1))), p0:(AND (GEQ s3 1) (GEQ s17 1)), p2:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stack based approach found an accepted trace after 38403 steps with 0 reset with depth 38404 and stack size 21336 in 124 ms.
FORMULA TCPcondis-PT-25-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-11 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(!(G(p0) U !(F(X(p2))&&p1))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:17] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:17] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 14:15:17] [INFO ] Implicit Places using invariants and state equation in 35 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
[2022-05-21 14:15:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s20 1)), p0:(AND (GEQ s4 1) (GEQ s21 1)), p2:(AND (GEQ s12 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1323 reset in 191 ms.
Product exploration explored 100000 steps with 1354 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Finished random walk after 1947 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=486 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p2), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 14:15:19] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 14:15:19] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:19] [INFO ] Added : 22 causal constraints over 5 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 14:15:19] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 14:15:19] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:19] [INFO ] Added : 26 causal constraints over 6 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:19] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:19] [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.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Finished random walk after 235 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p2), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:20] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 14:15:20] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-21 14:15:20] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 14:15:20] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-21 14:15:20] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 14:15:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 14:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 14:15:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 14:15:20] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 14:15:20] [INFO ] Added : 26 causal constraints over 6 iterations in 51 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1294 reset in 177 ms.
Product exploration explored 100000 steps with 1276 reset in 175 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 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 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 12 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2022-05-21 14:15:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 14:15:21] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 1344 reset in 170 ms.
Product exploration explored 100000 steps with 1347 reset in 178 ms.
Built C files in :
/tmp/ltsmin9535818405217350602
[2022-05-21 14:15:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9535818405217350602
Running compilation step : cd /tmp/ltsmin9535818405217350602;'/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 99 ms.
Running link step : cd /tmp/ltsmin9535818405217350602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin9535818405217350602;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10546625009257125467.hoa' '--buchi-type=spotba'
LTSmin run took 207 ms.
FORMULA TCPcondis-PT-25-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLFireability-12 finished in 4912 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(p0) U !p1) U (X(p2)||G(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 0 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 14:15:22] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:22] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 14:15:22] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 14:15:22] [INFO ] Implicit Places using invariants and state equation in 30 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
[2022-05-21 14:15:22] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 14:15:22] [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 163 ms :[(OR p0 p2), (OR p0 p2), p0, p2, true]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s24 1)), p0:(AND (GEQ s5 1) (GEQ s21 1)), p2:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 3 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-13 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F(G((!p0 U p1)))||p2)))))'
[2022-05-21 14:15:22] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4272351799365451722
[2022-05-21 14:15:22] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-21 14:15:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:22] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-21 14:15:22] [INFO ] Applying decomposition
[2022-05-21 14:15:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:22] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-21 14:15:22] [INFO ] Flatten gal took : 3 ms
[2022-05-21 14:15:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:15:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4272351799365451722
Running compilation step : cd /tmp/ltsmin4272351799365451722;'/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/graph17828421076915581308.txt' '-o' '/tmp/graph17828421076915581308.bin' '-w' '/tmp/graph17828421076915581308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17828421076915581308.bin' '-l' '-1' '-v' '-w' '/tmp/graph17828421076915581308.weights' '-q' '0' '-e' '0.001'
[2022-05-21 14:15:22] [INFO ] Decomposing Gal with order
[2022-05-21 14:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 14:15:22] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-21 14:15:22] [INFO ] Flatten gal took : 5 ms
[2022-05-21 14:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2022-05-21 14:15:22] [INFO ] Time to serialize gal into /tmp/LTLFireability14727498244294501500.gal : 1 ms
[2022-05-21 14:15:22] [INFO ] Time to serialize properties into /tmp/LTLFireability2741114641428667660.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/LTLFireability14727498244294501500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2741114641428667660.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...268
Read 1 LTL properties
Checking formula 0 : !((G(X(F((F(G((!("((i1.u3.FINACK>=1)&&(u7.xLASTACK>=1))"))U("((i1.u0.FINWAIT1>=1)&&(i1.u0.xFINACK>=1))"))))||("(u8.xCLOSED>=1)"))))))
Formula 0 simplified : !GXF("(u8.xCLOSED>=1)" | FG(!"((i1.u3.FINACK>=1)&&(u7.xLASTACK>=1))" U "((i1.u0.FINWAIT1>=1)&&(i1.u0.xFINACK>=1))"))
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin4272351799365451722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4272351799365451722;'/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' '[](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: [](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "[](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.026: State length is 31, there are 45 groups
pins2lts-mc-linux64( 0/ 8), 0.026: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.026: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.026: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.026: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.078: [Blue] ~120 levels ~960 states ~4240 transitions
pins2lts-mc-linux64( 0/ 8), 0.224: [Blue] ~240 levels ~1920 states ~8600 transitions
pins2lts-mc-linux64( 6/ 8), 0.379: [Blue] ~279 levels ~3840 states ~13408 transitions
pins2lts-mc-linux64( 3/ 8), 0.420: [Blue] ~315 levels ~7680 states ~26168 transitions
pins2lts-mc-linux64( 3/ 8), 0.556: [Blue] ~315 levels ~15360 states ~45216 transitions
pins2lts-mc-linux64( 3/ 8), 0.995: [Blue] ~315 levels ~30720 states ~86048 transitions
pins2lts-mc-linux64( 3/ 8), 1.365: [Blue] ~315 levels ~61440 states ~176280 transitions
pins2lts-mc-linux64( 2/ 8), 1.706: [Blue] ~387 levels ~122880 states ~370544 transitions
pins2lts-mc-linux64( 4/ 8), 2.318: [Blue] ~379 levels ~245760 states ~763552 transitions
pins2lts-mc-linux64( 4/ 8), 3.946: [Blue] ~379 levels ~491520 states ~1561424 transitions
pins2lts-mc-linux64( 0/ 8), 5.435: [Blue] ~821 levels ~983040 states ~2862976 transitions
pins2lts-mc-linux64( 0/ 8), 6.521: [Blue] ~821 levels ~1966080 states ~6226512 transitions
pins2lts-mc-linux64( 2/ 8), 8.741: [Blue] ~387 levels ~3932160 states ~14063208 transitions
pins2lts-mc-linux64( 7/ 8), 13.175: [Blue] ~334 levels ~7864320 states ~27374808 transitions
pins2lts-mc-linux64( 7/ 8), 22.562: [Blue] ~334 levels ~15728640 states ~58171248 transitions
pins2lts-mc-linux64( 7/ 8), 41.844: [Blue] ~334 levels ~31457280 states ~124141448 transitions
pins2lts-mc-linux64( 7/ 8), 84.061: [Blue] ~334 levels ~62914560 states ~260728256 transitions
pins2lts-mc-linux64( 3/ 8), 112.820: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 112.853:
pins2lts-mc-linux64( 0/ 8), 112.853: Explored 73720004 states 313066389 transitions, fanout: 4.247
pins2lts-mc-linux64( 0/ 8), 112.853: Total exploration time 112.790 sec (112.750 sec minimum, 112.779 sec on average)
pins2lts-mc-linux64( 0/ 8), 112.853: States per second: 653604, Transitions per second: 2775658
pins2lts-mc-linux64( 0/ 8), 112.853:
pins2lts-mc-linux64( 0/ 8), 112.853: State space has 67908813 states, 47168676 are accepting
pins2lts-mc-linux64( 0/ 8), 112.853: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 112.853: blue states: 73720004 (108.56%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 112.853: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 112.853: all-red states: 51456836 (75.77%), bogus 1958213 (2.88%)
pins2lts-mc-linux64( 0/ 8), 112.853:
pins2lts-mc-linux64( 0/ 8), 112.853: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 112.853:
pins2lts-mc-linux64( 0/ 8), 112.853: Queue width: 8B, total height: 3343, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 112.853: Tree memory: 774.1MB, 12.0 B/state, compr.: 9.5%
pins2lts-mc-linux64( 0/ 8), 112.853: Tree fill ratio (roots/leafs): 50.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 112.853: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 112.853: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 112.853: Est. total memory use: 774.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4272351799365451722;'/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' '[](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4272351799365451722;'/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' '[](X(<>((<>([]((!(LTLAPp0==true) U (LTLAPp1==true))))||(LTLAPp2==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 14:35:55] [INFO ] Flatten gal took : 3 ms
[2022-05-21 14:35:55] [INFO ] Time to serialize gal into /tmp/LTLFireability16264200199256227197.gal : 1 ms
[2022-05-21 14:35:55] [INFO ] Time to serialize properties into /tmp/LTLFireability16878823821074031146.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/LTLFireability16264200199256227197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16878823821074031146.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...290
Read 1 LTL properties
Checking formula 0 : !((G(X(F((F(G((!("((FINACK>=1)&&(xLASTACK>=1))"))U("((FINWAIT1>=1)&&(xFINACK>=1))"))))||("(xCLOSED>=1)"))))))
Formula 0 simplified : !GXF("(xCLOSED>=1)" | FG(!"((FINACK>=1)&&(xLASTACK>=1))" U "((FINWAIT1>=1)&&(xFINACK>=1))"))
Detected timeout of ITS tools.
[2022-05-21 14:56:30] [INFO ] Flatten gal took : 155 ms
[2022-05-21 14:56:30] [INFO ] Input system was already deterministic with 32 transitions.
[2022-05-21 14:56:30] [INFO ] Transformed 30 places.
[2022-05-21 14:56:30] [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 14:56:30] [INFO ] Time to serialize gal into /tmp/LTLFireability18274496351387749788.gal : 2 ms
[2022-05-21 14:56:30] [INFO ] Time to serialize properties into /tmp/LTLFireability15209701812237521845.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/LTLFireability18274496351387749788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15209701812237521845.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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(F((F(G((!("((FINACK>=1)&&(xLASTACK>=1))"))U("((FINWAIT1>=1)&&(xFINACK>=1))"))))||("(xCLOSED>=1)"))))))
Formula 0 simplified : !GXF("(xCLOSED>=1)" | FG(!"((FINACK>=1)&&(xLASTACK>=1))" U "((FINWAIT1>=1)&&(xFINACK>=1))"))

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

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