About the Execution of ITS-Tools for TCPcondis-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 606.151 | 36336.00 | 99828.00 | 497.00 | FFFFFTTFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699500524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is TCPcondis-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699500524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 16:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TCPcondis-PT-20-LTLFireability-00
FORMULA_NAME TCPcondis-PT-20-LTLFireability-01
FORMULA_NAME TCPcondis-PT-20-LTLFireability-02
FORMULA_NAME TCPcondis-PT-20-LTLFireability-03
FORMULA_NAME TCPcondis-PT-20-LTLFireability-04
FORMULA_NAME TCPcondis-PT-20-LTLFireability-05
FORMULA_NAME TCPcondis-PT-20-LTLFireability-06
FORMULA_NAME TCPcondis-PT-20-LTLFireability-07
FORMULA_NAME TCPcondis-PT-20-LTLFireability-08
FORMULA_NAME TCPcondis-PT-20-LTLFireability-09
FORMULA_NAME TCPcondis-PT-20-LTLFireability-10
FORMULA_NAME TCPcondis-PT-20-LTLFireability-11
FORMULA_NAME TCPcondis-PT-20-LTLFireability-12
FORMULA_NAME TCPcondis-PT-20-LTLFireability-13
FORMULA_NAME TCPcondis-PT-20-LTLFireability-14
FORMULA_NAME TCPcondis-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679245225113
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 17:00:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 17:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:00:26] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 17:00:26] [WARNING] Unknown XML tag in source file: size
[2023-03-19 17:00:26] [WARNING] Unknown XML tag in source file: color
[2023-03-19 17:00:26] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-19 17:00:26] [INFO ] Transformed 30 places.
[2023-03-19 17:00:26] [INFO ] Transformed 32 transitions.
[2023-03-19 17:00:26] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TCPcondis-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 102 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 17:00:26] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-19 17:00:27] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 17:00:27] [INFO ] Invariant cache hit.
[2023-03-19 17:00:27] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 17:00:27] [INFO ] Invariant cache hit.
[2023-03-19 17:00:27] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 25 out of 30 places after structural reductions.
[2023-03-19 17:00:27] [INFO ] Flatten gal took : 23 ms
[2023-03-19 17:00:27] [INFO ] Flatten gal took : 6 ms
[2023-03-19 17:00:27] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 28) seen :26
Finished Best-First random walk after 363 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=121 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 12 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-19 17:00:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 17:00:28] [INFO ] Invariant cache hit.
[2023-03-19 17:00:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 17:00:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:00:28] [INFO ] Invariant cache hit.
[2023-03-19 17:00:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 306 ms.
Stack based approach found an accepted trace after 4988 steps with 0 reset with depth 4989 and stack size 4989 in 14 ms.
FORMULA TCPcondis-PT-20-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-00 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(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
[2023-03-19 17:00:28] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 17:00:28] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:00:28] [INFO ] Invariant cache hit.
[2023-03-19 17:00:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-19 17:00:28] [INFO ] Invariant cache hit.
[2023-03-19 17:00:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p0:(OR (LT s13 1) (LT s25 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8514 reset in 275 ms.
Product exploration explored 100000 steps with 8590 reset in 275 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) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 316 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:30] [INFO ] Invariant cache hit.
[2023-03-19 17:00:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 17:00:30] [INFO ] Invariant cache hit.
[2023-03-19 17:00:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 17:00:30] [INFO ] Invariant cache hit.
[2023-03-19 17:00:30] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1765 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=252 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8510 reset in 123 ms.
Product exploration explored 100000 steps with 8583 reset in 132 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 29 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 17:00:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 17:00:32] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 28/30 places, 30/32 transitions.
Built C files in :
/tmp/ltsmin1130427692816634052
[2023-03-19 17:00:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1130427692816634052
Running compilation step : cd /tmp/ltsmin1130427692816634052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin1130427692816634052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1130427692816634052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4086320474761175200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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
[2023-03-19 17:00:47] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-19 17:00:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:00:47] [INFO ] Invariant cache hit.
[2023-03-19 17:00:47] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-19 17:00:47] [INFO ] Invariant cache hit.
[2023-03-19 17:00:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin1393071763091045233
[2023-03-19 17:00:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1393071763091045233
Running compilation step : cd /tmp/ltsmin1393071763091045233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin1393071763091045233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin1393071763091045233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased767838862028757509.hoa' '--buchi-type=spotba'
LTSmin run took 2205 ms.
FORMULA TCPcondis-PT-20-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-20-LTLFireability-01 finished in 21545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&(!p1 U (G((!p1||G(!p2)))||((!p1||G(!p2))&&p3)))) U p2))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p0), p2, (AND p1 p2), true]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s20 1)), p1:(AND (GEQ s8 1) (GEQ s20 1) (GEQ s12 1) (GEQ s26 1)), p3:(AND (GEQ s4 1) (GEQ s18 1)), p0:(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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 111 steps with 3 reset in 1 ms.
FORMULA TCPcondis-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-02 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1)) U ((p2||X(G(p2))) U !p3)))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 17:00:50] [INFO ] Invariant cache hit.
[2023-03-19 17:00:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 320 ms :[p3, (NOT p2), p3, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) p3), true, (NOT p1), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p1) (AND p3 (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p3 p1 p0), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(OR (LT s13 1) (LT s25 1) (LT s26 1)), p1:(GEQ s1 1), p0:(OR (GEQ s29 1) (AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1))), p2:(AND (GEQ s6 1) (GEQ s20 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][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-03 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1 U (p2||G(p1)))||X((p3 U p1))||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.
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), true]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s19 1)), p2:(AND (LT s0 1) (GEQ s9 1) (NOT (AND (GEQ s6 1) (GEQ s19 1)))), p1:(AND (GEQ s9 1) (NOT (AND (GEQ s6 1) (GEQ s19 1)))), p3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 1 reset in 0 ms.
FORMULA TCPcondis-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-04 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(p1)) U (G((!p0||X(p1)))||(!p2&&X(p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 17:00:51] [INFO ] Invariant cache hit.
[2023-03-19 17:00:51] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s24 1)), p0:(AND (GEQ s2 1) (GEQ s20 1)), p1:(LT s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) p1)
Knowledge based reduction with 14 factoid took 495 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-05 finished in 1047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:52] [INFO ] Invariant cache hit.
[2023-03-19 17:00:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 17:00:52] [INFO ] Invariant cache hit.
[2023-03-19 17:00:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-19 17:00:52] [INFO ] Invariant cache hit.
[2023-03-19 17:00:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s17 1)), p0:(LT s29 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 70 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-06 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:53] [INFO ] Invariant cache hit.
[2023-03-19 17:00:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:00:53] [INFO ] Invariant cache hit.
[2023-03-19 17:00:53] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 17:00:53] [INFO ] Invariant cache hit.
[2023-03-19 17:00:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s4 1) (GEQ s21 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][false, false, false, false]]
Product exploration explored 100000 steps with 2589 reset in 154 ms.
Product exploration explored 100000 steps with 2621 reset in 199 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 463 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=463 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 17:00:54] [INFO ] Invariant cache hit.
[2023-03-19 17:00:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 17:00:54] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-20-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-07 finished in 1502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 17:00:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 17:00:54] [INFO ] Invariant cache hit.
[2023-03-19 17:00:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 17:00:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:00:54] [INFO ] Invariant cache hit.
[2023-03-19 17:00:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2523 reset in 167 ms.
Stack based approach found an accepted trace after 46799 steps with 1190 reset with depth 55 and stack size 55 in 78 ms.
FORMULA TCPcondis-PT-20-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-08 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||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 4 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 17:00:55] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-19 17:00:55] [INFO ] Invariant cache hit.
[2023-03-19 17:00:55] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-19 17:00:55] [INFO ] Invariant cache hit.
[2023-03-19 17:00:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s27 1)), p1:(AND (GEQ s4 1) (GEQ s21 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 48 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-20-LTLFireability-10 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(((G(p2) U G(p3))&&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 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 17:00:55] [INFO ] Invariant cache hit.
[2023-03-19 17:00:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:00:55] [INFO ] Invariant cache hit.
[2023-03-19 17:00:55] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 17:00:55] [INFO ] Invariant cache hit.
[2023-03-19 17:00:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 808 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=3 dest: 11}, { cond=(AND p0 p1 p3 p2), acceptance={1} source=3 dest: 12}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0, 1} source=3 dest: 12}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1} source=3 dest: 13}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p3 p2), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=9 dest: 4}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p3) p2)), acceptance={} source=9 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 p2), acceptance={} source=9 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=10 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p2))), acceptance={} source=10 dest: 6}, { cond=(AND p1 p2), acceptance={} source=10 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=11 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=11 dest: 3}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=11 dest: 8}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2)), acceptance={0} source=11 dest: 11}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1} source=11 dest: 13}, { cond=(AND p0 p1 p3 p2), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=12 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=12 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p3 p2), acceptance={1} source=12 dest: 12}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=12 dest: 12}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=12 dest: 13}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=13 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=13 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=13 dest: 9}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))), acceptance={} source=13 dest: 10}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=13 dest: 11}, { cond=(AND p0 p1 p3 p2), acceptance={1} source=13 dest: 12}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0, 1} source=13 dest: 12}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))), acceptance={1} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=14 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=14 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=14 dest: 10}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=14 dest: 11}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=14 dest: 13}, { cond=(AND p0 p3 p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s20 1)), p1:(AND (GEQ s11 1) (GEQ s27 1)), p3:(GEQ s18 1), p2:(AND (GEQ s6 1) (GEQ s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-11 finished in 947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U (p2||G(p1)))||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: 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 4 ms. Remains 24 /30 variables (removed 6) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 24 cols
[2023-03-19 17:00:56] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 17:00:56] [INFO ] Invariant cache hit.
[2023-03-19 17:00:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 17:00:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:00:56] [INFO ] Invariant cache hit.
[2023-03-19 17:00:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 24/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s23 1) (GEQ s19 1)), p0:(OR (LT s5 1) (LT s15 1)), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1369 reset in 180 ms.
Product exploration explored 100000 steps with 1345 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 7732 steps, including 2 resets, run visited all 2 properties in 7 ms. (steps per millisecond=1104 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-19 17:00:57] [INFO ] Invariant cache hit.
[2023-03-19 17:00:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 17:00:57] [INFO ] Invariant cache hit.
[2023-03-19 17:00:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-19 17:00:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:00:57] [INFO ] Invariant cache hit.
[2023-03-19 17:00:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 24/24 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 2623 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=655 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1325 reset in 178 ms.
Product exploration explored 100000 steps with 1392 reset in 173 ms.
Built C files in :
/tmp/ltsmin6628547261803034501
[2023-03-19 17:00:58] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2023-03-19 17:00:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 17:00:58] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2023-03-19 17:00:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 17:00:58] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2023-03-19 17:00:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 17:00:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6628547261803034501
Running compilation step : cd /tmp/ltsmin6628547261803034501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin6628547261803034501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6628547261803034501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16520403952286391508.hoa' '--buchi-type=spotba'
LTSmin run took 431 ms.
FORMULA TCPcondis-PT-20-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-20-LTLFireability-12 finished in 3080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 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 12 place count 25 transition count 25
Applied a total of 12 rules in 4 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-19 17:00:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 17:00:59] [INFO ] Invariant cache hit.
[2023-03-19 17:00:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 17:00:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:00:59] [INFO ] Invariant cache hit.
[2023-03-19 17:00:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 2321 steps with 0 reset with depth 2322 and stack size 2322 in 5 ms.
FORMULA TCPcondis-PT-20-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-13 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 5 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 17:00:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 17:00:59] [INFO ] Invariant cache hit.
[2023-03-19 17:01:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-19 17:01:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:01:00] [INFO ] Invariant cache hit.
[2023-03-19 17:01:00] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : TCPcondis-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 61420 steps with 0 reset with depth 61421 and stack size 21330 in 147 ms.
FORMULA TCPcondis-PT-20-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-20-LTLFireability-15 finished in 561 ms.
All properties solved by simple procedures.
Total runtime 33901 ms.
BK_STOP 1679245261449
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699500524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-20.tgz
mv TCPcondis-PT-20 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 '
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 ;