About the Execution of LoLa+red for CloudOpsManagement-PT-05120by02560
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2173.924 | 83935.00 | 108476.00 | 873.10 | TF?FFF?FFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814398100547.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 lolaxred
Input is CloudOpsManagement-PT-05120by02560, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814398100547
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 01:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 CloudOpsManagement-PT-05120by02560-LTLCardinality-00
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-01
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-02
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-03
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-04
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-05
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-06
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-07
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-08
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-09
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-10
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-11
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-12
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-13
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-14
FORMULA_NAME CloudOpsManagement-PT-05120by02560-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678306069090
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudOpsManagement-PT-05120by02560
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 20:07:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 20:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:07:51] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-08 20:07:51] [INFO ] Transformed 27 places.
[2023-03-08 20:07:51] [INFO ] Transformed 29 transitions.
[2023-03-08 20:07:51] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 14 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 20:07:52] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-08 20:07:52] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 20:07:52] [INFO ] Invariant cache hit.
[2023-03-08 20:07:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:07:52] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 20:07:52] [INFO ] Invariant cache hit.
[2023-03-08 20:07:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 23 out of 27 places after structural reductions.
[2023-03-08 20:07:52] [INFO ] Flatten gal took : 37 ms
[2023-03-08 20:07:52] [INFO ] Flatten gal took : 15 ms
[2023-03-08 20:07:52] [INFO ] Input system was already deterministic with 29 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=262 ) properties (out of 34) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 20:07:53] [INFO ] Invariant cache hit.
[2023-03-08 20:07:53] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-08 20:07:53] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 20:07:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-08 20:07:53] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-08 20:07:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:07:53] [INFO ] After 42ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :5 sat :8
[2023-03-08 20:07:53] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-08 20:07:53] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 8 different solutions.
Finished Parikh walk after 12809 steps, including 0 resets, run visited all 2 properties in 93 ms. (steps per millisecond=137 )
Parikh walk visited 8 properties in 1776 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:07:56] [INFO ] Invariant cache hit.
[2023-03-08 20:07:56] [INFO ] Implicit Places using invariants in 67 ms returned [16, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-02 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:(GT s18 s14)], 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]]
Product exploration explored 100000 steps with 0 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 868 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1463 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1737629 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :{}
Probabilistic random walk after 1737629 steps, saw 1222258 distinct states, run finished after 3008 ms. (steps per millisecond=577 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 25 cols
[2023-03-08 20:08:01] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-08 20:08:01] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:01] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:01] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:01] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:01] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:01] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:01] [INFO ] After 14ms 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-08 20:08:01] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23039 steps, including 0 resets, run visited all 1 properties in 54 ms. (steps per millisecond=426 )
Parikh walk visited 1 properties in 55 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:08:02] [INFO ] Invariant cache hit.
[2023-03-08 20:08:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 20:08:02] [INFO ] Invariant cache hit.
[2023-03-08 20:08:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:02] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 20:08:02] [INFO ] Invariant cache hit.
[2023-03-08 20:08:02] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 25/25 places, 29/29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1463 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1896171 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1896171 steps, saw 1351968 distinct states, run finished after 3001 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:08:05] [INFO ] Invariant cache hit.
[2023-03-08 20:08:05] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:05] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:05] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-08 20:08:05] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:05] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:05] [INFO ] After 10ms 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-08 20:08:05] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23039 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=535 )
Parikh walk visited 1 properties in 43 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 29/29 transitions.
Graph (trivial) has 11 edges and 25 vertex of which 9 / 25 are part of one of the 4 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 10 ms. Remains 20 /25 variables (removed 5) and now considering 23/29 (removed 6) transitions.
[2023-03-08 20:08:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 20:08:07] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:07] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-08 20:08:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/25 places, 23/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 20/25 places, 23/29 transitions.
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 25 cols
[2023-03-08 20:08:07] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-08 20:08:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 20:08:07] [INFO ] Invariant cache hit.
[2023-03-08 20:08:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:07] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 20:08:07] [INFO ] Invariant cache hit.
[2023-03-08 20:08:07] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 25/25 places, 29/29 transitions.
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-02 finished in 11433 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)&&X(G(p1))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 20:08:07] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-08 20:08:07] [INFO ] Implicit Places using invariants in 82 ms returned [16, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT 3 s3), p0:(LEQ s18 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 5 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-03 finished in 340 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 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:08:08] [INFO ] Invariant cache hit.
[2023-03-08 20:08:08] [INFO ] Implicit Places using invariants in 41 ms returned [16, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 29/29 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s19), p0:(AND (LEQ s18 s8) (OR (LEQ s11 s4) (LEQ 2 s16)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-04 finished in 212 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 U G((F(p1) U X(p2)))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:08:08] [INFO ] Invariant cache hit.
[2023-03-08 20:08:08] [INFO ] Implicit Places using invariants in 46 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 593 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 4}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ s20 s5), p2:(LEQ s10 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 431 steps with 9 reset in 2 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-05 finished in 670 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(p1)||G(F(p2)))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 5 edges and 27 vertex of which 4 / 27 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 26
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 3 place count 25 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 23 transition count 25
Applied a total of 5 rules in 7 ms. Remains 23 /27 variables (removed 4) and now considering 25/29 (removed 4) transitions.
[2023-03-08 20:08:08] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 23 cols
[2023-03-08 20:08:08] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-08 20:08:08] [INFO ] Implicit Places using invariants in 40 ms returned [15, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 25/29 transitions.
Graph (trivial) has 5 edges and 21 vertex of which 2 / 21 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 24/25 (removed 1) transitions.
[2023-03-08 20:08:08] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-08 20:08:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-08 20:08:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 20:08:08] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:08] [INFO ] Invariant cache hit.
[2023-03-08 20:08:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/27 places, 24/29 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 20/27 places, 24/29 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s15 s12), p1:(OR (GT s15 s12) (GT 2 s16)), p2:(GT s15 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2425 reset in 308 ms.
Product exploration explored 100000 steps with 2437 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2049 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:08:10] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:10] [INFO ] Invariant cache hit.
[2023-03-08 20:08:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:10] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-08 20:08:10] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:10] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:10] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 20:08:10] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 20:08:10] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:10] [INFO ] Invariant cache hit.
[2023-03-08 20:08:10] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 20:08:10] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:10] [INFO ] Invariant cache hit.
[2023-03-08 20:08:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-08 20:08:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 20:08:11] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:11] [INFO ] Invariant cache hit.
[2023-03-08 20:08:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 20/20 places, 24/24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 405 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:08:11] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:11] [INFO ] Invariant cache hit.
[2023-03-08 20:08:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:11] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-08 20:08:11] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:11] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:11] [INFO ] After 13ms 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-08 20:08:11] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 499 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2332 reset in 289 ms.
Product exploration explored 100000 steps with 2398 reset in 395 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 24/24 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-08 20:08:13] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:13] [INFO ] Invariant cache hit.
[2023-03-08 20:08:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 20:08:13] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:13] [INFO ] Invariant cache hit.
[2023-03-08 20:08:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:13] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 20:08:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 20:08:13] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-08 20:08:13] [INFO ] Invariant cache hit.
[2023-03-08 20:08:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 20/20 places, 24/24 transitions.
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-06 finished in 4801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G((p1&&F(p2)))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 20:08:13] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 20:08:13] [INFO ] Implicit Places using invariants in 36 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(LEQ 2 s2), p2:(LEQ 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-07 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G((p0&&X(p1)))&&X(F(p2)))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:08:13] [INFO ] Invariant cache hit.
[2023-03-08 20:08:13] [INFO ] Implicit Places using invariants in 34 ms returned [16, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(GT 1 s12), p1:(GT 2 s12), p2:(LEQ s18 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-08 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-08 20:08:14] [INFO ] Invariant cache hit.
[2023-03-08 20:08:14] [INFO ] Implicit Places using invariants in 56 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s5 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-09 finished in 248 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))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 24
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 24 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 22
Applied a total of 9 rules in 7 ms. Remains 20 /27 variables (removed 7) and now considering 22/29 (removed 7) transitions.
[2023-03-08 20:08:14] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 20:08:14] [INFO ] Implicit Places using invariants in 36 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/27 places, 22/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49 ms. Remains : 19/27 places, 22/29 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-10 finished in 115 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 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-08 20:08:14] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-08 20:08:14] [INFO ] Implicit Places using invariants in 74 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-12 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 3 s9), p0:(LEQ 1 s9)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-12 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
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 3 place count 24 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 24
Applied a total of 5 rules in 6 ms. Remains 22 /27 variables (removed 5) and now considering 24/29 (removed 5) transitions.
[2023-03-08 20:08:15] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 22 cols
[2023-03-08 20:08:15] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 20:08:15] [INFO ] Implicit Places using invariants in 35 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 24/29 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 2 / 21 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 23/24 (removed 1) transitions.
[2023-03-08 20:08:15] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 20:08:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 20:08:15] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:15] [INFO ] Invariant cache hit.
[2023-03-08 20:08:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/27 places, 23/29 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 20/27 places, 23/29 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s14 s16) (LEQ s14 s5)), p0:(LEQ s14 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2049 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 609618 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 609618 steps, saw 440806 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-08 20:08:19] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:19] [INFO ] Invariant cache hit.
[2023-03-08 20:08:19] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:19] [INFO ] After 26ms 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), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-13 finished in 4754 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&&X((G(p1)||X(G(!p0)))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 24 transition count 23
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 24 transition count 20
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 18 transition count 20
Applied a total of 13 rules in 4 ms. Remains 18 /27 variables (removed 9) and now considering 20/29 (removed 9) transitions.
[2023-03-08 20:08:19] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 18 cols
[2023-03-08 20:08:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-08 20:08:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 20:08:19] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-08 20:08:19] [INFO ] Invariant cache hit.
[2023-03-08 20:08:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 20:08:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 20:08:19] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-08 20:08:19] [INFO ] Invariant cache hit.
[2023-03-08 20:08:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/27 places, 20/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 18/27 places, 20/29 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 4}], [{ cond=p0, acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ s6 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-14 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 23
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 23 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 21
Applied a total of 9 rules in 3 ms. Remains 19 /27 variables (removed 8) and now considering 21/29 (removed 8) transitions.
[2023-03-08 20:08:20] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 19 cols
[2023-03-08 20:08:20] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 20:08:20] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/27 places, 21/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 18/27 places, 21/29 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s13 s8)], 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 63 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-05120by02560-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-15 finished in 104 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)))'
Found a Lengthening insensitive property : CloudOpsManagement-PT-05120by02560-LTLCardinality-02
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 24 /27 variables (removed 3) and now considering 26/29 (removed 3) transitions.
[2023-03-08 20:08:20] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 24 cols
[2023-03-08 20:08:20] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-08 20:08:20] [INFO ] Implicit Places using invariants in 33 ms returned [15, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/27 places, 26/29 transitions.
Graph (trivial) has 8 edges and 22 vertex of which 4 / 22 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 23/26 (removed 3) transitions.
[2023-03-08 20:08:20] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:20] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 20:08:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 20:08:20] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:20] [INFO ] Invariant cache hit.
[2023-03-08 20:08:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 20/27 places, 23/29 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 110 ms. Remains : 20/27 places, 23/29 transitions.
Running random walk in product with property : CloudOpsManagement-PT-05120by02560-LTLCardinality-02 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:(GT s15 s12)], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 276 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2049 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2033267 steps, run timeout after 3001 ms. (steps per millisecond=677 ) properties seen :{}
Probabilistic random walk after 2033267 steps, saw 1356770 distinct states, run finished after 3001 ms. (steps per millisecond=677 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:08:24] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:24] [INFO ] Invariant cache hit.
[2023-03-08 20:08:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:24] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:24] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:24] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:24] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:24] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:24] [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-08 20:08:24] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 23/23 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Applied a total of 5 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 18/23 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 20/20 places, 18/23 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1824804 steps, run timeout after 3001 ms. (steps per millisecond=608 ) properties seen :{}
Probabilistic random walk after 1824804 steps, saw 1317549 distinct states, run finished after 3001 ms. (steps per millisecond=608 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 20:08:27] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 20:08:27] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:27] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:08:27] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:27] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:27] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:27] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:27] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 20:08:27] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12800 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=800 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-08 20:08:28] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 20:08:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 20:08:28] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:28] [INFO ] Invariant cache hit.
[2023-03-08 20:08:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 20:08:28] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:28] [INFO ] Invariant cache hit.
[2023-03-08 20:08:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 20/20 places, 23/23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2049 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2134680 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :{}
Probabilistic random walk after 2134680 steps, saw 1424247 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:08:31] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:31] [INFO ] Invariant cache hit.
[2023-03-08 20:08:31] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:31] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:31] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:31] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-08 20:08:31] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:31] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:31] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 20:08:31] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 23/23 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Applied a total of 5 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 18/23 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 20/20 places, 18/23 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2031197 steps, run timeout after 3001 ms. (steps per millisecond=676 ) properties seen :{}
Probabilistic random walk after 2031197 steps, saw 1464792 distinct states, run finished after 3001 ms. (steps per millisecond=676 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 20:08:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 20:08:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-08 20:08:34] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:08:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:08:34] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:34] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:08:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-08 20:08:34] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:34] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:08:34] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 20:08:34] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12800 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=853 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 388 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-08 20:08:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:08:36] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-08 20:08:36] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-08 20:08:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 20/20 places, 23/23 transitions.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-08 20:08:36] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:36] [INFO ] Invariant cache hit.
[2023-03-08 20:08:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 20:08:36] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:36] [INFO ] Invariant cache hit.
[2023-03-08 20:08:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:08:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 20:08:36] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2023-03-08 20:08:36] [INFO ] Invariant cache hit.
[2023-03-08 20:08:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 20/20 places, 23/23 transitions.
Treatment of property CloudOpsManagement-PT-05120by02560-LTLCardinality-02 finished in 16085 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(p1)||G(F(p2)))))'
[2023-03-08 20:08:36] [INFO ] Flatten gal took : 8 ms
[2023-03-08 20:08:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 20:08:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 29 transitions and 94 arcs took 1 ms.
Total runtime 44979 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CloudOpsManagement-PT-05120by02560
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality
BK_STOP 1678306153025
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CloudOpsManagement-PT-05120by02560-LTLCardinality-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 23/32 CloudOpsManagement-PT-05120by02560-LTLCardinality-02 3224508 m, 644901 m/sec, 4830781 t fired, .
Time elapsed: 5 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for CloudOpsManagement-PT-05120by02560-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CloudOpsManagement-PT-05120by02560-LTLCardinality-06
lola: time limit : 3590 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3590 8/32 CloudOpsManagement-PT-05120by02560-LTLCardinality-06 1134172 m, 226834 m/sec, 3171299 t fired, .
Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3590 15/32 CloudOpsManagement-PT-05120by02560-LTLCardinality-06 2159439 m, 205053 m/sec, 6174680 t fired, .
Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3590 21/32 CloudOpsManagement-PT-05120by02560-LTLCardinality-06 3164163 m, 200944 m/sec, 9137989 t fired, .
Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3590 27/32 CloudOpsManagement-PT-05120by02560-LTLCardinality-06 4150036 m, 197174 m/sec, 12055379 t fired, .
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CloudOpsManagement-PT-05120by02560-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudOpsManagement-PT-05120by02560-LTLCardinality-02: LTL unknown AGGR
CloudOpsManagement-PT-05120by02560-LTLCardinality-06: LTL unknown AGGR
Time elapsed: 35 secs. Pages in use: 32
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="CloudOpsManagement-PT-05120by02560"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CloudOpsManagement-PT-05120by02560, 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 r071-smll-167814398100547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-05120by02560.tgz
mv CloudOpsManagement-PT-05120by02560 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 '
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 ;