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.r133-smll-167819411000452.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411000452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:22 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 DoubleExponent-PT-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678465578828

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=DoubleExponent-PT-002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 16:26:21] [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-10 16:26:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:26:22] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-10 16:26:22] [INFO ] Transformed 110 places.
[2023-03-10 16:26:22] [INFO ] Transformed 98 transitions.
[2023-03-10 16:26:22] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 23 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:22] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-10 16:26:22] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-10 16:26:22] [INFO ] Invariant cache hit.
[2023-03-10 16:26:22] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-10 16:26:22] [INFO ] Invariant cache hit.
[2023-03-10 16:26:22] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 33 out of 106 places after structural reductions.
[2023-03-10 16:26:23] [INFO ] Flatten gal took : 47 ms
[2023-03-10 16:26:23] [INFO ] Flatten gal took : 19 ms
[2023-03-10 16:26:23] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 328 resets, run finished after 1089 ms. (steps per millisecond=9 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-10 16:26:25] [INFO ] Invariant cache hit.
[2023-03-10 16:26:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:26:25] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:26:25] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :1 sat :5 real:12
[2023-03-10 16:26:25] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 11 ms to minimize.
[2023-03-10 16:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-10 16:26:25] [INFO ] After 351ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-10 16:26:25] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-10 16:26:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:26:25] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-10 16:26:26] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-10 16:26:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2023-03-10 16:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 16:26:26] [INFO ] After 521ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-10 16:26:26] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 395 ms.
Support contains 19 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 91
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 99 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 95 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 95 transition count 83
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 91 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 56 place count 78 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 77 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 77 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 76 transition count 69
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 66 place count 76 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 72 place count 70 transition count 63
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 79 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 69 transition count 62
Applied a total of 80 rules in 66 ms. Remains 69 /106 variables (removed 37) and now considering 62/98 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 69/106 places, 62/98 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 530 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 534 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 528 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 62 rows 69 cols
[2023-03-10 16:26:28] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-10 16:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 16:26:28] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:26:28] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-10 16:26:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 16:26:28] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 16:26:29] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 16:26:29] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 16:26:29] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 16:26:29] [INFO ] After 32ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-10 16:26:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2023-03-10 16:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-10 16:26:29] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-10 16:26:29] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 42 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 62/62 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 58 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 57 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 57 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 54 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 53 transition count 48
Applied a total of 33 rules in 22 ms. Remains 53 /69 variables (removed 16) and now considering 48/62 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 53/69 places, 48/62 transitions.
Incomplete random walk after 10000 steps, including 1359 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 48 rows 53 cols
[2023-03-10 16:26:30] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:26:30] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-10 16:26:30] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-10 16:26:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 16:26:30] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 16:26:30] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 16:26:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 16:26:30] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 16:26:30] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 16:26:30] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 16:26:30] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 16:26:30] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 47
Applied a total of 2 rules in 8 ms. Remains 52 /53 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 52/53 places, 47/48 transitions.
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Finished probabilistic random walk after 1960 steps, run visited all 5 properties in 25 ms. (steps per millisecond=78 )
Probabilistic random walk after 1960 steps, saw 1008 distinct states, run finished after 26 ms. (steps per millisecond=75 ) properties seen :5
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
FORMULA DoubleExponent-PT-002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(!p1 U !p0)&&X(p2))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:32] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:26:32] [INFO ] Implicit Places using invariants in 65 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 105/106 places, 98/98 transitions.
Stuttering acceptance computed with spot in 383 ms :[true, (OR (NOT p2) p0), p0]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p0 p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s90 1), p1:(OR (AND (GEQ s75 1) (GEQ s93 1)) (GEQ s90 1)), p2:(AND (GEQ s42 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 536 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(!((G(!G(p0))&&X(X(!p0))) U !p1))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 84 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 44 place count 83 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 58 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 57 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 56 transition count 50
Applied a total of 99 rules in 47 ms. Remains 56 /106 variables (removed 50) and now considering 50/98 (removed 48) transitions.
// Phase 1: matrix 50 rows 56 cols
[2023-03-10 16:26:32] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:32] [INFO ] Implicit Places using invariants in 125 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/106 places, 50/98 transitions.
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 7 place count 50 transition count 46
Applied a total of 7 rules in 20 ms. Remains 50 /54 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-10 16:26:32] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:26:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-10 16:26:32] [INFO ] Invariant cache hit.
[2023-03-10 16:26:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:26:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/106 places, 46/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 423 ms. Remains : 50/106 places, 46/98 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s32 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 515 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 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 44 place count 83 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 78 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 94 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 49
Applied a total of 99 rules in 28 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-10 16:26:33] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants in 82 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 146 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 7 place count 49 transition count 45
Applied a total of 7 rules in 4 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-10 16:26:33] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-10 16:26:33] [INFO ] Invariant cache hit.
[2023-03-10 16:26:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 314 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-03 finished in 383 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) U G((p1&&F(p2)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:33] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants in 131 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:33] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 16:26:33] [INFO ] Invariant cache hit.
[2023-03-10 16:26:33] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 453 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LT s34 1), p2:(AND (GEQ s37 1) (GEQ s57 1)), p0:(OR (GEQ s26 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 763 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) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 74
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 48 place count 82 transition count 70
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 78 transition count 70
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 98 place count 57 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 55 transition count 49
Applied a total of 102 rules in 18 ms. Remains 55 /106 variables (removed 51) and now considering 49/98 (removed 49) transitions.
// Phase 1: matrix 49 rows 55 cols
[2023-03-10 16:26:34] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants in 87 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/106 places, 49/98 transitions.
Graph (complete) has 149 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 7 place count 49 transition count 45
Applied a total of 7 rules in 7 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 49 cols
[2023-03-10 16:26:34] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 16:26:34] [INFO ] Invariant cache hit.
[2023-03-10 16:26:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/106 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 332 ms. Remains : 49/106 places, 45/98 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s17 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-06 finished in 440 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((G(p1)&&p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:34] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants in 86 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-10 16:26:34] [INFO ] Invariant cache hit.
[2023-03-10 16:26:34] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s58 1) (GEQ s65 1)), p0:(AND (GEQ s10 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-08 finished in 525 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&&X((p0 U (!p1||G(p0)))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:35] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:35] [INFO ] Implicit Places using invariants in 83 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:35] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:26:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 16:26:35] [INFO ] Invariant cache hit.
[2023-03-10 16:26:35] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s85 1), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 521 ms.
Product exploration explored 100000 steps with 33333 reset in 405 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 1598 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(G((F(!(p0 U p1))||(G(p0)&&p2))))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 84 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 80 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 90 place count 60 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 58 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 57 transition count 51
Applied a total of 95 rules in 17 ms. Remains 57 /106 variables (removed 49) and now considering 51/98 (removed 47) transitions.
// Phase 1: matrix 51 rows 57 cols
[2023-03-10 16:26:36] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:36] [INFO ] Implicit Places using invariants in 87 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/106 places, 51/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 54 transition count 49
Applied a total of 4 rules in 6 ms. Remains 54 /56 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 54 cols
[2023-03-10 16:26:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 16:26:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 16:26:36] [INFO ] Invariant cache hit.
[2023-03-10 16:26:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:26:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/106 places, 49/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 54/106 places, 49/98 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s38 1) (GEQ s46 1)), p0:(GEQ s2 1), p2:(GEQ s17 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12329 reset in 459 ms.
Product exploration explored 100000 steps with 12387 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 484 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 1226 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 765 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 736 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 738 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 759 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Probably explored full state space saw : 1996 states, properties seen :3
Probabilistic random walk after 3991 steps, saw 1996 distinct states, run finished after 41 ms. (steps per millisecond=97 ) properties seen :3
Explored full state space saw : 1996 states, properties seen :0
Exhaustive walk after 3991 steps, saw 1996 distinct states, run finished after 29 ms. (steps per millisecond=137 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 11 factoid took 737 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p1, p1]
Stuttering acceptance computed with spot in 98 ms :[p1, p1]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-10 16:26:40] [INFO ] Invariant cache hit.
[2023-03-10 16:26:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 16:26:40] [INFO ] Invariant cache hit.
[2023-03-10 16:26:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:26:40] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-10 16:26:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 16:26:40] [INFO ] Invariant cache hit.
[2023-03-10 16:26:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 54/54 places, 49/49 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 144 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 342 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 112 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1241 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 752 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 757 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 755 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Probably explored full state space saw : 1996 states, properties seen :2
Probabilistic random walk after 3991 steps, saw 1996 distinct states, run finished after 18 ms. (steps per millisecond=221 ) properties seen :2
Explored full state space saw : 1996 states, properties seen :0
Exhaustive walk after 3991 steps, saw 1996 distinct states, run finished after 8 ms. (steps per millisecond=498 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 565 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p1, p1]
Stuttering acceptance computed with spot in 104 ms :[p1, p1]
Stuttering acceptance computed with spot in 90 ms :[p1, p1]
Product exploration explored 100000 steps with 12279 reset in 290 ms.
Product exploration explored 100000 steps with 12365 reset in 236 ms.
Built C files in :
/tmp/ltsmin6382190333398077364
[2023-03-10 16:26:42] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2023-03-10 16:26:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:26:42] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2023-03-10 16:26:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:26:42] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2023-03-10 16:26:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:26:42] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6382190333398077364
Running compilation step : cd /tmp/ltsmin6382190333398077364;'/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 377 ms.
Running link step : cd /tmp/ltsmin6382190333398077364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6382190333398077364;'/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/stateBased4259679052651151592.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-10 finished in 6748 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))||F((p1||(!p2 U p3)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:43] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-10 16:26:43] [INFO ] Implicit Places using invariants in 89 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:43] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:26:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 16:26:43] [INFO ] Invariant cache hit.
[2023-03-10 16:26:43] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s102 1)), p3:(GEQ s56 1), p0:(LT s39 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 3485 reset in 130 ms.
Product exploration explored 100000 steps with 3479 reset in 150 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 664 steps, including 21 resets, run visited all 3 properties in 17 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 322 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-10 16:26:45] [INFO ] Invariant cache hit.
[2023-03-10 16:26:45] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 16:26:45] [INFO ] Invariant cache hit.
[2023-03-10 16:26:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-10 16:26:45] [INFO ] Invariant cache hit.
[2023-03-10 16:26:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Finished random walk after 99 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 6 factoid took 439 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 3470 reset in 112 ms.
Product exploration explored 100000 steps with 3474 reset in 125 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 18 place count 102 transition count 98
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 102 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 98 transition count 94
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 98 transition count 94
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 52 place count 98 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 97 transition count 98
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 97 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 97 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 93 transition count 104
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 93 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 65 rules in 38 ms. Remains 93 /103 variables (removed 10) and now considering 104/97 (removed -7) transitions.
[2023-03-10 16:26:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 104 rows 93 cols
[2023-03-10 16:26:47] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-10 16:26:47] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 93/103 places, 104/97 transitions.
Built C files in :
/tmp/ltsmin14381685485126371423
[2023-03-10 16:26:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14381685485126371423
Running compilation step : cd /tmp/ltsmin14381685485126371423;'/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 364 ms.
Running link step : cd /tmp/ltsmin14381685485126371423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14381685485126371423;'/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/stateBased8758797501952060036.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 5053 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(p0)||X(F(p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:48] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:48] [INFO ] Implicit Places using invariants in 86 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:48] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 16:26:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-10 16:26:48] [INFO ] Invariant cache hit.
[2023-03-10 16:26:48] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-13 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:(GEQ s7 1), p1:(OR (LT s58 1) (LT s65 1) (GEQ s7 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 33333 reset in 105 ms.
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-13 finished in 882 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&&F(!p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-10 16:26:49] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 16:26:49] [INFO ] Implicit Places using invariants in 110 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2023-03-10 16:26:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-10 16:26:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 16:26:49] [INFO ] Invariant cache hit.
[2023-03-10 16:26:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 103/106 places, 97/98 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s86 1)), p1:(AND (GEQ s9 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3324 reset in 110 ms.
Product exploration explored 100000 steps with 3305 reset in 117 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 359 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 73 ms. (steps per millisecond=100 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 73 ms. (steps per millisecond=100 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 487 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-10 16:26:52] [INFO ] Invariant cache hit.
[2023-03-10 16:26:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-10 16:26:52] [INFO ] Invariant cache hit.
[2023-03-10 16:26:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-10 16:26:52] [INFO ] Invariant cache hit.
[2023-03-10 16:26:52] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7362 steps, run visited all 3 properties in 64 ms. (steps per millisecond=115 )
Probabilistic random walk after 7362 steps, saw 3706 distinct states, run finished after 64 ms. (steps per millisecond=115 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Product exploration explored 100000 steps with 3346 reset in 107 ms.
Product exploration explored 100000 steps with 3326 reset in 115 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 24 place count 102 transition count 99
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 102 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 98 transition count 95
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 98 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 57 place count 98 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 97 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 97 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 97 transition count 114
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 92 transition count 104
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 73 rules in 21 ms. Remains 92 /103 variables (removed 11) and now considering 104/97 (removed -7) transitions.
[2023-03-10 16:26:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 92 cols
[2023-03-10 16:26:55] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-10 16:26:55] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/103 places, 104/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 92/103 places, 104/97 transitions.
Built C files in :
/tmp/ltsmin512420860908127529
[2023-03-10 16:26:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin512420860908127529
Running compilation step : cd /tmp/ltsmin512420860908127529;'/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 243 ms.
Running link step : cd /tmp/ltsmin512420860908127529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin512420860908127529;'/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/stateBased1612726131634393198.hoa' '--buchi-type=spotba'
LTSmin run took 281 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 6410 ms.
All properties solved by simple procedures.
Total runtime 33911 ms.

BK_STOP 1678465616947

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r133-smll-167819411000452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;