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.r073-smll-167814399700523.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 ltsminxred
Input is CloudOpsManagement-PT-00640by00320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399700523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 11K Feb 26 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 00:58 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.3K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 01:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:01 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-00640by00320-LTLCardinality-00
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-01
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-02
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-03
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-04
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-05
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-06
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-07
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-08
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-09
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-10
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-11
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-12
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-13
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-14
FORMULA_NAME CloudOpsManagement-PT-00640by00320-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678543132932

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudOpsManagement-PT-00640by00320
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 13:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 13:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:58:56] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-11 13:58:56] [INFO ] Transformed 27 places.
[2023-03-11 13:58:56] [INFO ] Transformed 29 transitions.
[2023-03-11 13:58:56] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Support contains 26 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 21 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-11 13:58:57] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 13:58:57] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-11 13:58:57] [INFO ] Invariant cache hit.
[2023-03-11 13:58:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:58:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-11 13:58:57] [INFO ] Invariant cache hit.
[2023-03-11 13:58:57] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 26 out of 27 places after structural reductions.
[2023-03-11 13:58:57] [INFO ] Flatten gal took : 48 ms
[2023-03-11 13:58:57] [INFO ] Flatten gal took : 14 ms
[2023-03-11 13:58:57] [INFO ] Input system was already deterministic with 29 transitions.
Support contains 25 out of 27 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10273 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=125 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 13:58:58] [INFO ] Invariant cache hit.
[2023-03-11 13:58:58] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 13:58:58] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 13:58:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-11 13:58:58] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-11 13:58:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:58:58] [INFO ] After 31ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-11 13:58:58] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 13:58:58] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 4445 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=296 )
Parikh walk visited 5 properties in 738 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((X((!p2 U (!p0||G(!p2))))&&p1)))))'
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-11 13:58:59] [INFO ] Invariant cache hit.
[2023-03-11 13:58:59] [INFO ] Implicit Places using invariants in 66 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 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 2 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 74 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 509 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s15 s3), p1:(AND (GT s6 s16) (LEQ 3 s12)), p2:(OR (LEQ s6 s16) (GT 3 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 652 ms.
Product exploration explored 100000 steps with 0 reset in 602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1058 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10271 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=641 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 24 cols
[2023-03-11 13:59:03] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 13:59:03] [INFO ] After 30ms SMT Verify possible using all constraints in real 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0 p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1338 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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.
[2023-03-11 13:59:04] [INFO ] Invariant cache hit.
[2023-03-11 13:59:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 13:59:04] [INFO ] Invariant cache hit.
[2023-03-11 13:59:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:04] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-11 13:59:04] [INFO ] Invariant cache hit.
[2023-03-11 13:59:05] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 24/24 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 : [(AND p0 (NOT p1) p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 938 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10592 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1176 ) properties (out of 6) seen :0
Finished Best-First random walk after 3607 steps, including 1 resets, run visited all 6 properties in 12 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 14 factoid took 1230 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 541 ms.
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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.
[2023-03-11 13:59:09] [INFO ] Invariant cache hit.
[2023-03-11 13:59:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 13:59:09] [INFO ] Invariant cache hit.
[2023-03-11 13:59:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:09] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-11 13:59:09] [INFO ] Invariant cache hit.
[2023-03-11 13:59:09] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 24/24 places, 29/29 transitions.
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-00 finished in 9977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 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 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-11 13:59:09] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 13:59:09] [INFO ] Implicit Places using invariants in 71 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 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 75 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-01 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:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-01 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 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 4 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 21 ms. Remains 19 /27 variables (removed 8) and now considering 21/29 (removed 8) transitions.
[2023-03-11 13:59:09] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 19 cols
[2023-03-11 13:59:09] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 13:59:09] [INFO ] Implicit Places using invariants in 53 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 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 3 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 79 ms. Remains : 18/27 places, 21/29 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 3 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-02 finished in 204 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(X(p1))))&&F(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-11 13:59:10] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 13:59:10] [INFO ] Implicit Places using invariants in 67 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 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 72 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s15 s17), p0:(GT s15 s14)], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-03 finished in 314 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 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 23 transition count 22
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 23 transition count 19
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 19
Applied a total of 13 rules in 8 ms. Remains 17 /27 variables (removed 10) and now considering 19/29 (removed 10) transitions.
[2023-03-11 13:59:10] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 17 cols
[2023-03-11 13:59:10] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 13:59:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 13:59:10] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-11 13:59:10] [INFO ] Invariant cache hit.
[2023-03-11 13:59:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-11 13:59:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 13:59:10] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-11 13:59:10] [INFO ] Invariant cache hit.
[2023-03-11 13:59:10] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/27 places, 19/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 17/27 places, 19/29 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-04 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 s11 s16)], 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 8554 steps with 0 reset in 49 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-04 finished in 307 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((F(p0)||X(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 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-11 13:59:10] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-11 13:59:10] [INFO ] Implicit Places using invariants in 59 ms returned [16, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 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 70 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s8 s21), p1:(LEQ 2 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Product exploration explored 100000 steps with 33333 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 p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-05 finished in 1167 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 6 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 6 ms. Remains 18 /27 variables (removed 9) and now considering 20/29 (removed 9) transitions.
[2023-03-11 13:59:11] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 18 cols
[2023-03-11 13:59:11] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 13:59:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 13:59:11] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-11 13:59:11] [INFO ] Invariant cache hit.
[2023-03-11 13:59:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-11 13:59:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 13:59:12] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-11 13:59:12] [INFO ] Invariant cache hit.
[2023-03-11 13:59:12] [INFO ] Dead Transitions using invariants and state equation in 47 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 168 ms. Remains : 18/27 places, 20/29 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-07 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 s11 s2)], 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 17 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-07 finished in 240 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))||X(G(!p0))))'
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 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-11 13:59:12] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 13:59:12] [INFO ] Implicit Places using invariants in 68 ms returned [19, 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 73 ms. Remains : 25/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s3 s12), p0:(AND (LEQ 2 s7) (LEQ s16 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 113 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 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-08 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0||G(p1)))) U 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 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-11 13:59:12] [INFO ] Invariant cache hit.
[2023-03-11 13:59:12] [INFO ] Implicit Places using invariants in 56 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 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 60 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s19), p0:(LEQ s20 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-11 finished in 307 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 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 10 ms. Remains 20 /27 variables (removed 7) and now considering 22/29 (removed 7) transitions.
[2023-03-11 13:59:13] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-11 13:59:13] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 13:59:13] [INFO ] Implicit Places using invariants in 49 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 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 64 ms. Remains : 19/27 places, 22/29 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-12 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 s14 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Product exploration explored 100000 steps with 0 reset in 209 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 7710 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1927 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 13:59:14] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 19 cols
[2023-03-11 13:59:14] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 13:59:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 13:59:14] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-11 13:59:14] [INFO ] Invariant cache hit.
[2023-03-11 13:59:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-11 13:59:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 13:59:14] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-11 13:59:14] [INFO ] Invariant cache hit.
[2023-03-11 13:59:14] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 19/19 places, 22/22 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Incomplete random walk after 10274 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1467 ) properties (out of 1) seen :0
Finished Best-First random walk after 1960 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=490 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 13:59:15] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-11 13:59:15] [INFO ] Invariant cache hit.
[2023-03-11 13:59:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 13:59:15] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-11 13:59:15] [INFO ] Invariant cache hit.
[2023-03-11 13:59:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 13:59:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 13:59:15] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-11 13:59:15] [INFO ] Invariant cache hit.
[2023-03-11 13:59:15] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 19/19 places, 22/22 transitions.
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-12 finished in 2348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 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-11 13:59:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 13:59:15] [INFO ] Implicit Places using invariants in 49 ms returned [16, 19, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 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 54 ms. Remains : 24/27 places, 29/29 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (LEQ s15 s0) (LEQ 2 s19))], 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]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-14 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)&&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 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 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 8 ms. Remains 22 /27 variables (removed 5) and now considering 24/29 (removed 5) transitions.
[2023-03-11 13:59:15] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 22 cols
[2023-03-11 13:59:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 13:59:15] [INFO ] Implicit Places using invariants in 49 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 24/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 21/27 places, 24/29 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s14 s17), p1:(LEQ 2 s1), p2:(GT 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-00640by00320-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-15 finished in 586 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)||G(F((X((!p2 U (!p0||G(!p2))))&&p1)))))'
Found a Shortening insensitive property : CloudOpsManagement-PT-00640by00320-LTLCardinality-00
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Support contains 5 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 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.
Applied a total of 1 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 27/29 (removed 2) transitions.
[2023-03-11 13:59:16] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 25 cols
[2023-03-11 13:59:16] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 13:59:16] [INFO ] Implicit Places using invariants in 60 ms returned [16, 18, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/27 places, 27/29 transitions.
Graph (trivial) has 5 edges and 22 vertex of which 2 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 25/27 (removed 2) transitions.
[2023-03-11 13:59:16] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 21 cols
[2023-03-11 13:59:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 13:59:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 13:59:16] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-11 13:59:16] [INFO ] Invariant cache hit.
[2023-03-11 13:59:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:17] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/27 places, 25/29 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 184 ms. Remains : 21/27 places, 25/29 transitions.
Running random walk in product with property : CloudOpsManagement-PT-00640by00320-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s15 s3), p1:(AND (GT s6 s16) (LEQ 3 s12)), p2:(OR (LEQ s6 s16) (GT 3 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 247 ms.
Product exploration explored 100000 steps with 0 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1075 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10594 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=963 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 13:59:18] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-11 13:59:18] [INFO ] Invariant cache hit.
[2023-03-11 13:59:18] [INFO ] After 26ms SMT Verify possible using all constraints in real 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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0 p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1204 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-11 13:59:20] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-11 13:59:20] [INFO ] Invariant cache hit.
[2023-03-11 13:59:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 13:59:20] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-11 13:59:20] [INFO ] Invariant cache hit.
[2023-03-11 13:59:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 13:59:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 13:59:20] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-11 13:59:20] [INFO ] Invariant cache hit.
[2023-03-11 13:59:20] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 21/21 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1130 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Incomplete random walk after 10277 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1468 ) properties (out of 6) seen :3
Finished Best-First random walk after 1846 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=461 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 14 factoid took 942 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
Treatment of property CloudOpsManagement-PT-00640by00320-LTLCardinality-00 finished in 7298 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
[2023-03-11 13:59:23] [INFO ] Flatten gal took : 10 ms
[2023-03-11 13:59:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-11 13:59:23] [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 27377 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1592/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1592/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudOpsManagement-PT-00640by00320-LTLCardinality-00
Could not compute solution for formula : CloudOpsManagement-PT-00640by00320-LTLCardinality-12

BK_STOP 1678543165397

--------------------
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
mcc2023
ltl formula name CloudOpsManagement-PT-00640by00320-LTLCardinality-00
ltl formula formula --ltl=/tmp/1592/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 27 places, 29 transitions and 94 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1592/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1592/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1592/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1592/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CloudOpsManagement-PT-00640by00320-LTLCardinality-12
ltl formula formula --ltl=/tmp/1592/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 27 places, 29 transitions and 94 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1592/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1592/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1592/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1592/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-00640by00320"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudOpsManagement-PT-00640by00320, 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 r073-smll-167814399700523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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