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-167819411100459.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-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 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.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 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:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 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 50K 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-003-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678468034620

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 17:07:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 17:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:07:18] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-10 17:07:18] [INFO ] Transformed 163 places.
[2023-03-10 17:07:18] [INFO ] Transformed 148 transitions.
[2023-03-10 17:07:18] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-003-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 148
Applied a total of 3 rules in 27 ms. Remains 160 /163 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 160 cols
[2023-03-10 17:07:18] [INFO ] Computed 17 place invariants in 21 ms
[2023-03-10 17:07:18] [INFO ] Implicit Places using invariants in 324 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 147
Applied a total of 2 rules in 19 ms. Remains 158 /159 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 158 cols
[2023-03-10 17:07:18] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-10 17:07:18] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-10 17:07:18] [INFO ] Invariant cache hit.
[2023-03-10 17:07:19] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/163 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 875 ms. Remains : 158/163 places, 147/148 transitions.
Support contains 46 out of 158 places after structural reductions.
[2023-03-10 17:07:19] [INFO ] Flatten gal took : 57 ms
[2023-03-10 17:07:19] [INFO ] Flatten gal took : 27 ms
[2023-03-10 17:07:19] [INFO ] Input system was already deterministic with 147 transitions.
Support contains 45 out of 158 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-10 17:07:20] [INFO ] Invariant cache hit.
[2023-03-10 17:07:21] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 17:07:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-10 17:07:21] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 24 ms returned sat
[2023-03-10 17:07:21] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 9 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 417 ms
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2023-03-10 17:07:22] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2023-03-10 17:07:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-10 17:07:23] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-10 17:07:23] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2023-03-10 17:07:23] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2023-03-10 17:07:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 349 ms
[2023-03-10 17:07:23] [INFO ] After 1970ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-10 17:07:23] [INFO ] After 2555ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 395 ms.
Support contains 25 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 147/147 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 158 transition count 128
Reduce places removed 19 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 26 rules applied. Total rules applied 45 place count 139 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 52 place count 132 transition count 121
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 52 place count 132 transition count 115
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 64 place count 126 transition count 115
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 102 place count 107 transition count 96
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 106 place count 105 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 105 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 104 transition count 95
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 119 place count 104 transition count 84
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 130 place count 93 transition count 84
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 137 place count 93 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 92 transition count 83
Applied a total of 138 rules in 64 ms. Remains 92 /158 variables (removed 66) and now considering 83/147 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 92/158 places, 83/147 transitions.
Incomplete random walk after 10000 steps, including 720 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 600130 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 13=1}
Probabilistic random walk after 600130 steps, saw 300224 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 92 cols
[2023-03-10 17:07:28] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 17:07:28] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:07:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 17:07:28] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-10 17:07:28] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:07:28] [INFO ] After 13ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:28] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 17:07:28] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 83/83 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 92 transition count 79
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 88 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 87 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 86 transition count 77
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 32 place count 76 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 75 transition count 67
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 75 transition count 61
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 46 place count 69 transition count 61
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 51 place count 69 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 68 transition count 60
Applied a total of 52 rules in 31 ms. Remains 68 /92 variables (removed 24) and now considering 60/83 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 68/92 places, 60/83 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 586987 states, properties seen :0
Probabilistic random walk after 1174001 steps, saw 586987 distinct states, run finished after 2912 ms. (steps per millisecond=403 ) properties seen :0
Interrupted probabilistic random walk after 1133688 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Exhaustive walk after 1133688 steps, saw 567177 distinct states, run finished after 3008 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 68 cols
[2023-03-10 17:07:34] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-10 17:07:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:07:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 17:07:34] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-10 17:07:34] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 17:07:34] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:34] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 17:07:34] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 60/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 68 /68 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/68 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:07:34] [INFO ] Invariant cache hit.
[2023-03-10 17:07:34] [INFO ] Implicit Places using invariants in 151 ms returned [14, 21, 36, 41, 60, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 152 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/68 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 58
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 59 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 59 transition count 56
Applied a total of 7 rules in 15 ms. Remains 59 /62 variables (removed 3) and now considering 56/60 (removed 4) transitions.
// Phase 1: matrix 56 rows 59 cols
[2023-03-10 17:07:34] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 17:07:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-10 17:07:34] [INFO ] Invariant cache hit.
[2023-03-10 17:07:34] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:07:34] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/68 places, 56/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 433 ms. Remains : 59/68 places, 56/60 transitions.
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1163149 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{}
Probabilistic random walk after 1163149 steps, saw 581565 distinct states, run finished after 3002 ms. (steps per millisecond=387 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:07:37] [INFO ] Invariant cache hit.
[2023-03-10 17:07:37] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:07:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 17:07:37] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-10 17:07:37] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:07:37] [INFO ] After 18ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-10 17:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-10 17:07:38] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 17:07:38] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-10 17:07:38] [INFO ] Invariant cache hit.
[2023-03-10 17:07:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-10 17:07:38] [INFO ] Invariant cache hit.
[2023-03-10 17:07:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:07:38] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-10 17:07:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:07:38] [INFO ] Invariant cache hit.
[2023-03-10 17:07:38] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 59/59 places, 56/56 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 59 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 55 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 55 transition count 52
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 10 place count 54 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 54 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 53 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 51 transition count 48
Applied a total of 16 rules in 26 ms. Remains 51 /59 variables (removed 8) and now considering 48/56 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 51 cols
[2023-03-10 17:07:38] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 17:07:38] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:07:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 17:07:38] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-10 17:07:38] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:07:38] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:38] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 17:07:38] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA DoubleExponent-PT-003-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DoubleExponent-PT-003-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 262 edges and 158 vertex of which 155 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 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)||G((p1&&X(G(!p0)))))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 155 transition count 116
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 126 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 124 transition count 114
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 63 place count 124 transition count 106
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 79 place count 116 transition count 106
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 131 place count 90 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 87 transition count 80
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 87 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 86 transition count 79
Applied a total of 139 rules in 30 ms. Remains 86 /158 variables (removed 72) and now considering 79/147 (removed 68) transitions.
// Phase 1: matrix 79 rows 86 cols
[2023-03-10 17:07:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:07:39] [INFO ] Implicit Places using invariants in 125 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/158 places, 79/147 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 85 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 78
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 4 place count 83 transition count 77
Applied a total of 4 rules in 11 ms. Remains 83 /85 variables (removed 2) and now considering 77/79 (removed 2) transitions.
// Phase 1: matrix 77 rows 83 cols
[2023-03-10 17:07:39] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-10 17:07:39] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 17:07:39] [INFO ] Invariant cache hit.
[2023-03-10 17:07:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:07:39] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/158 places, 77/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 442 ms. Remains : 83/158 places, 77/147 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s22 s76), p1:(LEQ s5 s15)], nbAcceptance=2, 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 10294 steps with 1436 reset in 112 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-00 finished in 913 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((F(p0) U (G(p1)&&F(p2))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-10 17:07:40] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 17:07:40] [INFO ] Implicit Places using invariants in 97 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s131 s15), p0:(LEQ s127 s130), p2:(LEQ s119 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3319 reset in 253 ms.
Product exploration explored 100000 steps with 3350 reset in 374 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 557 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 317 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 147 rows 156 cols
[2023-03-10 17:07:42] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-10 17:07:42] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 17:07:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:07:42] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 17:07:42] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-10 17:07:42] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-10 17:07:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-10 17:07:42] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 17:07:42] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 154 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 118 transition count 109
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 74 place count 118 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 88 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 148 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 156 place count 77 transition count 72
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 167 place count 77 transition count 61
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 178 place count 66 transition count 61
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 189 place count 66 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 65 transition count 60
Applied a total of 190 rules in 39 ms. Remains 65 /156 variables (removed 91) and now considering 60/147 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 65/156 places, 60/147 transitions.
Finished random walk after 1264 steps, including 158 resets, run visited all 1 properties in 4 ms. (steps per millisecond=316 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 692 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 156 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 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 154 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 121 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 119 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 114 transition count 105
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 133 place count 88 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 85 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 84 transition count 78
Applied a total of 140 rules in 30 ms. Remains 84 /156 variables (removed 72) and now considering 78/147 (removed 69) transitions.
// Phase 1: matrix 78 rows 84 cols
[2023-03-10 17:07:43] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 17:07:44] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-10 17:07:44] [INFO ] Invariant cache hit.
[2023-03-10 17:07:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:07:44] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-10 17:07:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:07:44] [INFO ] Invariant cache hit.
[2023-03-10 17:07:44] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/156 places, 78/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 84/156 places, 78/147 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1396 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:07:45] [INFO ] Invariant cache hit.
[2023-03-10 17:07:45] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:07:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:07:45] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 17:07:45] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:07:45] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:07:45] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 17:07:45] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 78/78 transitions.
Graph (complete) has 216 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 3 place count 83 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 82 transition count 76
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 14 place count 77 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 76 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 27 place count 76 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 38 place count 65 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 48 place count 65 transition count 60
Applied a total of 48 rules in 15 ms. Remains 65 /84 variables (removed 19) and now considering 60/78 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 65/84 places, 60/78 transitions.
Finished random walk after 4668 steps, including 584 resets, run visited all 1 properties in 7 ms. (steps per millisecond=666 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 459 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 13897 reset in 329 ms.
Product exploration explored 100000 steps with 13758 reset in 404 ms.
Built C files in :
/tmp/ltsmin11672921125231321659
[2023-03-10 17:07:47] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-10 17:07:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:07:47] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-10 17:07:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:07:47] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-10 17:07:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:07:47] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11672921125231321659
Running compilation step : cd /tmp/ltsmin11672921125231321659;'/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 638 ms.
Running link step : cd /tmp/ltsmin11672921125231321659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin11672921125231321659;'/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/stateBased7185188170980569227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 81 transition count 76
Applied a total of 6 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 81 cols
[2023-03-10 17:08:02] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:08:02] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 17:08:02] [INFO ] Invariant cache hit.
[2023-03-10 17:08:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:08:03] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-10 17:08:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:08:03] [INFO ] Invariant cache hit.
[2023-03-10 17:08:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 76/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 454 ms. Remains : 81/84 places, 76/78 transitions.
Built C files in :
/tmp/ltsmin15007956436904058040
[2023-03-10 17:08:03] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2023-03-10 17:08:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:08:03] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2023-03-10 17:08:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:08:03] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2023-03-10 17:08:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:08:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15007956436904058040
Running compilation step : cd /tmp/ltsmin15007956436904058040;'/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 393 ms.
Running link step : cd /tmp/ltsmin15007956436904058040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15007956436904058040;'/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/stateBased15667049729086859018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 17:08:18] [INFO ] Flatten gal took : 11 ms
[2023-03-10 17:08:18] [INFO ] Flatten gal took : 9 ms
[2023-03-10 17:08:18] [INFO ] Time to serialize gal into /tmp/LTL4509437323731722801.gal : 3 ms
[2023-03-10 17:08:18] [INFO ] Time to serialize properties into /tmp/LTL18157269852839296360.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4509437323731722801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13731815378720601351.hoa' '-atoms' '/tmp/LTL18157269852839296360.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18157269852839296360.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13731815378720601351.hoa
Reverse transition relation is NOT exact ! Due to transitions t31.t32, t41, t42.t43, t50, t53, t56, t59, t61.t92, t94.t95, t102, t106, t107, t126.t137, t13...566
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
[2023-03-10 17:08:33] [INFO ] Flatten gal took : 13 ms
[2023-03-10 17:08:33] [INFO ] Flatten gal took : 12 ms
[2023-03-10 17:08:33] [INFO ] Time to serialize gal into /tmp/LTL3144411024766832030.gal : 4 ms
[2023-03-10 17:08:33] [INFO ] Time to serialize properties into /tmp/LTL11916108630120941901.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3144411024766832030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11916108630120941901.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(p73<=p76)"))U((G("(p77<=p112)"))&&(F("(p65<=p113)")))))))
Formula 0 simplified : XF(G!"(p73<=p76)" R (F!"(p77<=p112)" | G!"(p65<=p113)"))
Reverse transition relation is NOT exact ! Due to transitions t31.t32, t41, t42.t43, t50, t53, t56, t59, t61.t92, t94.t95, t102, t106, t107, t126.t137, t13...525
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
[2023-03-10 17:08:48] [INFO ] Flatten gal took : 12 ms
[2023-03-10 17:08:48] [INFO ] Applying decomposition
[2023-03-10 17:08:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8122800826303943952.txt' '-o' '/tmp/graph8122800826303943952.bin' '-w' '/tmp/graph8122800826303943952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8122800826303943952.bin' '-l' '-1' '-v' '-w' '/tmp/graph8122800826303943952.weights' '-q' '0' '-e' '0.001'
[2023-03-10 17:08:48] [INFO ] Decomposing Gal with order
[2023-03-10 17:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 17:08:48] [INFO ] Removed a total of 52 redundant transitions.
[2023-03-10 17:08:48] [INFO ] Flatten gal took : 106 ms
[2023-03-10 17:08:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2023-03-10 17:08:48] [INFO ] Time to serialize gal into /tmp/LTL1680949173109736453.gal : 5 ms
[2023-03-10 17:08:48] [INFO ] Time to serialize properties into /tmp/LTL10144827848151303419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1680949173109736453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10144827848151303419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(gu23.p73<=gu23.p76)"))U((G("(gu3.p77<=gu3.p112)"))&&(F("(gu21.p65<=gu21.p113)")))))))
Formula 0 simplified : XF(G!"(gu23.p73<=gu23.p76)" R (F!"(gu3.p77<=gu3.p112)" | G!"(gu21.p65<=gu21.p113)"))
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.t56, gi1.gi0.t59, gi1.gi0.t126_t137, gi1.gi0.t134_t135, gi1.gi0.t142, gi1.gi0.t145, g...716
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14207796338191074078
[2023-03-10 17:09:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14207796338191074078
Running compilation step : cd /tmp/ltsmin14207796338191074078;'/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 365 ms.
Running link step : cd /tmp/ltsmin14207796338191074078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14207796338191074078;'/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' '--ltl' 'X([]((<>((LTLAPp0==true)) U ([]((LTLAPp1==true))&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 99035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G((X(!(X(p0) U X(p1)))&&p0)))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 121 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 114 transition count 104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 137 place count 87 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
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 145 place count 83 transition count 77
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 82 transition count 76
Applied a total of 148 rules in 21 ms. Remains 82 /158 variables (removed 76) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 82 cols
[2023-03-10 17:09:19] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:09:19] [INFO ] Implicit Places using invariants in 105 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/158 places, 76/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 74
Applied a total of 4 rules in 4 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-10 17:09:19] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 17:09:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-10 17:09:19] [INFO ] Invariant cache hit.
[2023-03-10 17:09:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:09:19] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/158 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 473 ms. Remains : 79/158 places, 74/147 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 1 s2), p0:(GT s29 s26)], 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 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-02 finished in 554 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)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-10 17:09:19] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 17:09:19] [INFO ] Implicit Places using invariants in 137 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-04 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: 2}]], initial=1, aps=[p0:(AND (GT 3 s71) (GT s60 s54))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-04 finished in 297 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 G((p1&&X((p2&&F(p1)))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 5 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-10 17:09:19] [INFO ] Invariant cache hit.
[2023-03-10 17:09:20] [INFO ] Implicit Places using invariants in 156 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p2) (NOT p1)), true, (AND p1 (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s95 s87), p0:(AND (LEQ s72 s53) (LEQ 1 s143)), p2:(GT 1 s143)], 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]]
Entered a terminal (fully accepting) state of product in 4447 steps with 150 reset in 8 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-06 finished in 527 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)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 3 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-10 17:09:20] [INFO ] Invariant cache hit.
[2023-03-10 17:09:20] [INFO ] Implicit Places using invariants in 128 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-07 finished in 1301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
[2023-03-10 17:09:21] [INFO ] Invariant cache hit.
[2023-03-10 17:09:21] [INFO ] Implicit Places using invariants in 250 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s50 s124), p0:(LEQ s114 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-08 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 110
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 120 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 71 place count 120 transition count 105
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 115 transition count 105
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 137 place count 87 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 143 place count 84 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 83 transition count 76
Applied a total of 144 rules in 19 ms. Remains 83 /158 variables (removed 75) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 83 cols
[2023-03-10 17:09:22] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 17:09:22] [INFO ] Implicit Places using invariants in 134 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/158 places, 76/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 74
Applied a total of 4 rules in 4 ms. Remains 80 /82 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 80 cols
[2023-03-10 17:09:22] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 17:09:23] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-10 17:09:23] [INFO ] Invariant cache hit.
[2023-03-10 17:09:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:09:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/158 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 472 ms. Remains : 80/158 places, 74/147 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s38), p1:(GT s22 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-09 finished in 612 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)&&F(p2))))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 3 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-10 17:09:23] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-10 17:09:23] [INFO ] Implicit Places using invariants in 195 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s67 s82), p1:(LEQ s17 s135), p2:(GT s150 s155)], 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]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-10 finished in 453 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((p0&&G(F(p1)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 157 transition count 112
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 123 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 122 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 70 place count 122 transition count 104
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 84 place count 115 transition count 104
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 140 place count 87 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 84 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 83 transition count 75
Applied a total of 147 rules in 19 ms. Remains 83 /158 variables (removed 75) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 83 cols
[2023-03-10 17:09:23] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 17:09:24] [INFO ] Implicit Places using invariants in 208 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/158 places, 75/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 80 transition count 73
Applied a total of 4 rules in 5 ms. Remains 80 /82 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-10 17:09:24] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:09:24] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-10 17:09:24] [INFO ] Invariant cache hit.
[2023-03-10 17:09:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:09:24] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/158 places, 73/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 519 ms. Remains : 80/158 places, 73/147 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s14 s63), p0:(LEQ s24 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13860 reset in 471 ms.
Product exploration explored 100000 steps with 13917 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1381 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1014161 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1014161 steps, saw 507235 distinct states, run finished after 3003 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:09:28] [INFO ] Invariant cache hit.
[2023-03-10 17:09:28] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:09:28] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 17:09:28] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:09:28] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:28] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 17:09:28] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 73/73 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 26 place count 67 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 36 place count 67 transition count 60
Applied a total of 36 rules in 8 ms. Remains 67 /80 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 67/80 places, 60/73 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 590288 states, properties seen :0
Probabilistic random walk after 1180601 steps, saw 590288 distinct states, run finished after 2936 ms. (steps per millisecond=402 ) properties seen :0
Interrupted probabilistic random walk after 1088436 steps, run timeout after 3004 ms. (steps per millisecond=362 ) properties seen :{}
Exhaustive walk after 1088436 steps, saw 544570 distinct states, run finished after 3004 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 67 cols
[2023-03-10 17:09:34] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:09:35] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 17:09:35] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 17:09:35] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:35] [INFO ] After 10ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:35] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 17:09:35] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 67/67 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:09:35] [INFO ] Invariant cache hit.
[2023-03-10 17:09:35] [INFO ] Implicit Places using invariants in 122 ms returned [35, 40, 58, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 124 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/67 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 58
Applied a total of 4 rules in 6 ms. Remains 61 /63 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 61 cols
[2023-03-10 17:09:35] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-10 17:09:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 17:09:35] [INFO ] Invariant cache hit.
[2023-03-10 17:09:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:35] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/67 places, 58/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 459 ms. Remains : 61/67 places, 58/60 transitions.
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1197131 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :{}
Probabilistic random walk after 1197131 steps, saw 598691 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:09:38] [INFO ] Invariant cache hit.
[2023-03-10 17:09:38] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 17:09:38] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 17:09:38] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:38] [INFO ] After 13ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:38] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-10 17:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-10 17:09:38] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 17:09:38] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-10 17:09:38] [INFO ] Invariant cache hit.
[2023-03-10 17:09:38] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-10 17:09:38] [INFO ] Invariant cache hit.
[2023-03-10 17:09:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:39] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-10 17:09:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:09:39] [INFO ] Invariant cache hit.
[2023-03-10 17:09:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 61/61 places, 58/58 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 55
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 56 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 53
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 12 place count 55 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 50
Applied a total of 16 rules in 15 ms. Remains 53 /61 variables (removed 8) and now considering 50/58 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 53 cols
[2023-03-10 17:09:39] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 17:09:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 17:09:39] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 17:09:39] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:09:39] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:39] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 17:09:39] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 80 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 : 80/80 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-10 17:09:40] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 17:09:40] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 17:09:40] [INFO ] Invariant cache hit.
[2023-03-10 17:09:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:09:40] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-10 17:09:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:09:40] [INFO ] Invariant cache hit.
[2023-03-10 17:09:40] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 80/80 places, 73/73 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1059982 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1059982 steps, saw 530151 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:09:43] [INFO ] Invariant cache hit.
[2023-03-10 17:09:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 17:09:43] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-10 17:09:43] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:09:43] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:43] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 17:09:43] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 73/73 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 71
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 78 transition count 60
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 26 place count 67 transition count 60
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 36 place count 67 transition count 60
Applied a total of 36 rules in 8 ms. Remains 67 /80 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 67/80 places, 60/73 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1075849 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1075849 steps, saw 538120 distinct states, run finished after 3004 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 67 cols
[2023-03-10 17:09:46] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 17:09:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 17:09:47] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 17:09:47] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:47] [INFO ] After 9ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:47] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 17:09:47] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 67/67 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-10 17:09:47] [INFO ] Invariant cache hit.
[2023-03-10 17:09:47] [INFO ] Implicit Places using invariants in 103 ms returned [35, 40, 58, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/67 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 58
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 61 cols
[2023-03-10 17:09:47] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 17:09:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-10 17:09:47] [INFO ] Invariant cache hit.
[2023-03-10 17:09:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:47] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/67 places, 58/60 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 402 ms. Remains : 61/67 places, 58/60 transitions.
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1208963 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :{}
Probabilistic random walk after 1208963 steps, saw 604585 distinct states, run finished after 3004 ms. (steps per millisecond=402 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 17:09:50] [INFO ] Invariant cache hit.
[2023-03-10 17:09:50] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 17:09:50] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 17:09:50] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:50] [INFO ] After 11ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:50] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-10 17:09:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-10 17:09:50] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 17:09:50] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-10 17:09:50] [INFO ] Invariant cache hit.
[2023-03-10 17:09:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 17:09:50] [INFO ] Invariant cache hit.
[2023-03-10 17:09:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 17:09:51] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-10 17:09:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:09:51] [INFO ] Invariant cache hit.
[2023-03-10 17:09:51] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 61/61 places, 58/58 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 55
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 56 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 53
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 12 place count 55 transition count 52
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 50
Applied a total of 16 rules in 7 ms. Remains 53 /61 variables (removed 8) and now considering 50/58 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 53 cols
[2023-03-10 17:09:51] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-10 17:09:51] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 17:09:51] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 17:09:51] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:09:51] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:09:51] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 17:09:51] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13968 reset in 189 ms.
Product exploration explored 100000 steps with 13760 reset in 211 ms.
Built C files in :
/tmp/ltsmin3800108769922918709
[2023-03-10 17:09:52] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2023-03-10 17:09:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:09:52] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2023-03-10 17:09:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:09:52] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2023-03-10 17:09:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:09:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3800108769922918709
Running compilation step : cd /tmp/ltsmin3800108769922918709;'/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 248 ms.
Running link step : cd /tmp/ltsmin3800108769922918709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3800108769922918709;'/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/stateBased1640435482237204731.hoa' '--buchi-type=spotba'
LTSmin run took 3556 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLCardinality-11 finished in 32116 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(p0)||F(p1)) U !p0)))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 2 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2023-03-10 17:09:55] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:09:56] [INFO ] Implicit Places using invariants in 92 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s46 s65), p0:(LEQ s96 s139)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-14 finished in 267 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((F(p0) U (G(p1)&&F(p2))))))'
Found a Lengthening insensitive property : DoubleExponent-PT-003-LTLCardinality-01
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 114
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 122 transition count 112
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 122 transition count 107
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 117 transition count 107
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 129 place count 91 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 88 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 87 transition count 80
Applied a total of 136 rules in 25 ms. Remains 87 /158 variables (removed 71) and now considering 80/147 (removed 67) transitions.
// Phase 1: matrix 80 rows 87 cols
[2023-03-10 17:09:56] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 17:09:56] [INFO ] Implicit Places using invariants in 102 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 86/158 places, 80/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 78
Applied a total of 4 rules in 5 ms. Remains 84 /86 variables (removed 2) and now considering 78/80 (removed 2) transitions.
// Phase 1: matrix 78 rows 84 cols
[2023-03-10 17:09:56] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 17:09:57] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 17:09:57] [INFO ] Invariant cache hit.
[2023-03-10 17:09:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:09:57] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 84/158 places, 78/147 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 437 ms. Remains : 84/158 places, 78/147 transitions.
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s69 s10), p0:(LEQ s66 s68), p2:(LEQ s62 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13914 reset in 227 ms.
Product exploration explored 100000 steps with 13937 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2023-03-10 17:09:58] [INFO ] Invariant cache hit.
[2023-03-10 17:09:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:09:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:09:58] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 17:09:58] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 730 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 84 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 : 84/84 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-10 17:10:00] [INFO ] Invariant cache hit.
[2023-03-10 17:10:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-10 17:10:00] [INFO ] Invariant cache hit.
[2023-03-10 17:10:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:10:00] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-10 17:10:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:10:00] [INFO ] Invariant cache hit.
[2023-03-10 17:10:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 343 ms. Remains : 84/84 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 226 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 407 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1362 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 786 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Finished Best-First random walk after 8589 steps, including 697 resets, run visited all 3 properties in 51 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 610 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 13927 reset in 205 ms.
Product exploration explored 100000 steps with 13892 reset in 226 ms.
Built C files in :
/tmp/ltsmin8442997677336086714
[2023-03-10 17:10:03] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-10 17:10:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:03] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-10 17:10:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:03] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-10 17:10:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8442997677336086714
Running compilation step : cd /tmp/ltsmin8442997677336086714;'/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 266 ms.
Running link step : cd /tmp/ltsmin8442997677336086714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8442997677336086714;'/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/stateBased9044791134500320231.hoa' '--buchi-type=spotba'
LTSmin run took 10865 ms.
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 18147 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2023-03-10 17:10:14] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17758499712568936613
[2023-03-10 17:10:14] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2023-03-10 17:10:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:14] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2023-03-10 17:10:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:14] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2023-03-10 17:10:14] [INFO ] Applying decomposition
[2023-03-10 17:10:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:10:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17758499712568936613
Running compilation step : cd /tmp/ltsmin17758499712568936613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-10 17:10:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6170715484952551337.txt' '-o' '/tmp/graph6170715484952551337.bin' '-w' '/tmp/graph6170715484952551337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6170715484952551337.bin' '-l' '-1' '-v' '-w' '/tmp/graph6170715484952551337.weights' '-q' '0' '-e' '0.001'
[2023-03-10 17:10:14] [INFO ] Decomposing Gal with order
[2023-03-10 17:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 17:10:14] [INFO ] Removed a total of 38 redundant transitions.
[2023-03-10 17:10:14] [INFO ] Flatten gal took : 29 ms
[2023-03-10 17:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2023-03-10 17:10:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality15766225223572152481.gal : 7 ms
[2023-03-10 17:10:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality5382635029941818932.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15766225223572152481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5382635029941818932.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(gu54.p73<=gu54.p76)"))U((G("(gu7.p77<=gu7.p112)"))&&(F("(gu50.p65<=gu50.p113)")))))))
Formula 0 simplified : XF(G!"(gu54.p73<=gu54.p76)" R (F!"(gu7.p77<=gu7.p112)" | G!"(gu50.p65<=gu50.p113)"))
Compilation finished in 605 ms.
Running link step : cd /tmp/ltsmin17758499712568936613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17758499712568936613;'/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' '--ltl' 'X([]((<>((LTLAPp0==true)) U ([]((LTLAPp1==true))&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 25886 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 202994 ms.

BK_STOP 1678468242124

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-003"
export BK_EXAMINATION="LTLCardinality"
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-003, examination is LTLCardinality"
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-167819411100459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;