About the Execution of LTSMin+red for CloudOpsManagement-PT-20480by10240
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3181.256 | 43053.00 | 62822.00 | 773.30 | FFFFFTF??TFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399700564.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-20480by10240, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399700564
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 11K Feb 26 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 01:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:04 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-20480by10240-LTLFireability-00
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-01
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-02
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-03
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-04
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-05
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-06
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-07
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-08
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-09
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-10
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-11
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-12
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-13
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-14
FORMULA_NAME CloudOpsManagement-PT-20480by10240-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678589976602
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudOpsManagement-PT-20480by10240
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 02:59:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 02:59:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 02:59:39] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-12 02:59:39] [INFO ] Transformed 27 places.
[2023-03-12 02:59:39] [INFO ] Transformed 29 transitions.
[2023-03-12 02:59:39] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 15 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-12 02:59:39] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 02:59:39] [INFO ] Implicit Places using invariants in 177 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 26/27 places, 29/29 transitions.
Support contains 22 out of 26 places after structural reductions.
[2023-03-12 02:59:39] [INFO ] Flatten gal took : 25 ms
[2023-03-12 02:59:39] [INFO ] Flatten gal took : 10 ms
[2023-03-12 02:59:39] [INFO ] Input system was already deterministic with 29 transitions.
Incomplete random walk after 10241 steps, including 0 resets, run finished after 106 ms. (steps per millisecond=96 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 29 rows 26 cols
[2023-03-12 02:59:40] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 02:59:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 02:59:40] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 02:59:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 02:59:40] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 02:59:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:40] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 02:59:40] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 02:59:40] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 40803 steps, including 0 resets, run visited all 2 properties in 850 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 857 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||(G(F(p1)) U p2)))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 02:59:41] [INFO ] Invariant cache hit.
[2023-03-12 02:59:41] [INFO ] Implicit Places using invariants in 47 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 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 51 ms. Remains : 24/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s4 1)), p2:(GEQ s21 1), p1:(AND (GEQ s0 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 3 reset in 3 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-00 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Graph (trivial) has 9 edges and 26 vertex of which 7 / 26 are part of one of the 3 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 22 transition count 23
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 22 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 22
Applied a total of 5 rules in 15 ms. Remains 20 /26 variables (removed 6) and now considering 22/29 (removed 7) transitions.
[2023-03-12 02:59:42] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-12 02:59:42] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants in 67 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/26 places, 22/29 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 18 /19 variables (removed 1) and now considering 21/22 (removed 1) transitions.
[2023-03-12 02:59:42] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 18 cols
[2023-03-12 02:59:42] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 02:59:42] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2023-03-12 02:59:42] [INFO ] Invariant cache hit.
[2023-03-12 02:59:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/26 places, 21/29 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 18/26 places, 21/29 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-01 finished in 258 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Graph (trivial) has 9 edges and 26 vertex of which 7 / 26 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 22 transition count 23
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 22 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 22
Applied a total of 5 rules in 5 ms. Remains 20 /26 variables (removed 6) and now considering 22/29 (removed 7) transitions.
[2023-03-12 02:59:42] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 20 cols
[2023-03-12 02:59:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants in 44 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/26 places, 22/29 transitions.
Applied a total of 0 rules in 1 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 51 ms. Remains : 19/26 places, 22/29 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-03 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:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-03 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))||(p2&&(X(!p0) U ((p1&&X(!p0))||X(G(!p0))))))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 26 cols
[2023-03-12 02:59:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants in 38 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 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 41 ms. Remains : 24/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, false]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={1} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 1}, { cond=p0, acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LT s2 1), p1:(LT s17 1), p0:(AND (GEQ s8 1) (GEQ s9 1))], nbAcceptance=2, 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 55 steps with 9 reset in 2 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-04 finished in 250 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((X(X((!p0&&G(p1))))||G(p2))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 02:59:42] [INFO ] Invariant cache hit.
[2023-03-12 02:59:42] [INFO ] Implicit Places using invariants in 36 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 25/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p0) p1), false]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p0) (AND p2 (NOT p1))), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=8 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s16 1)), p0:(LT s14 1), p1:(AND (GEQ s0 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-06 finished in 407 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||G(!p1)||G((p2 U p3)))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 02:59:43] [INFO ] Invariant cache hit.
[2023-03-12 02:59:43] [INFO ] Implicit Places using invariants in 39 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 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 43 ms. Remains : 24/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s3 1) (LT s4 1)), p0:(GEQ s3 1), p3:(AND (GEQ s6 1) (GEQ s23 1)), p2:(GEQ s18 1)], nbAcceptance=2, 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 18174 reset in 388 ms.
Product exploration explored 100000 steps with 18074 reset in 376 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) p3 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=640 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 29 rows 24 cols
[2023-03-12 02:59:45] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 02:59:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 02:59:45] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-12 02:59:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 02:59:45] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 02:59:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:45] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-12 02:59:45] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 02:59:45] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 30727 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=731 )
Parikh walk visited 2 properties in 509 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (G (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (OR (AND p1 p2 (NOT p0)) (AND p1 (NOT p0) p3))))]
Knowledge based reduction with 9 factoid took 534 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
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 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 02:59:46] [INFO ] Invariant cache hit.
[2023-03-12 02:59:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 02:59:46] [INFO ] Invariant cache hit.
[2023-03-12 02:59:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-12 02:59:46] [INFO ] Invariant cache hit.
[2023-03-12 02:59:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 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 (NOT p0) (NOT p2) p3 p1), (X (OR p1 p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3413 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 02:59:47] [INFO ] Invariant cache hit.
[2023-03-12 02:59:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 02:59:47] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 02:59:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 02:59:47] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 02:59:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:47] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 02:59:47] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 02:59:47] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 51208 steps, including 0 resets, run visited all 1 properties in 59 ms. (steps per millisecond=867 )
Parikh walk visited 2 properties in 495 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (OR p1 p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 18179 reset in 162 ms.
Product exploration explored 100000 steps with 18069 reset in 294 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 29/29 transitions.
Graph (trivial) has 11 edges and 24 vertex of which 8 / 24 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Applied a total of 1 rules in 3 ms. Remains 19 /24 variables (removed 5) and now considering 22/29 (removed 7) transitions.
[2023-03-12 02:59:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 02:59:49] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 19 cols
[2023-03-12 02:59:49] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 02:59:49] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/24 places, 22/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 19/24 places, 22/29 transitions.
Support contains 4 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.
// Phase 1: matrix 29 rows 24 cols
[2023-03-12 02:59:49] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 02:59:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 02:59:49] [INFO ] Invariant cache hit.
[2023-03-12 02:59:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:49] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-12 02:59:49] [INFO ] Invariant cache hit.
[2023-03-12 02:59:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 24/24 places, 29/29 transitions.
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-07 finished in 6556 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Graph (trivial) has 11 edges and 26 vertex of which 9 / 26 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 transition count 21
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 21 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 17 transition count 19
Applied a total of 9 rules in 3 ms. Remains 17 /26 variables (removed 9) and now considering 19/29 (removed 10) transitions.
[2023-03-12 02:59:49] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 17 cols
[2023-03-12 02:59:49] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 02:59:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 02:59:49] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 02:59:49] [INFO ] Invariant cache hit.
[2023-03-12 02:59:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-12 02:59:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 02:59:49] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 02:59:49] [INFO ] Invariant cache hit.
[2023-03-12 02:59:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/26 places, 19/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 17/26 places, 19/29 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 372 ms.
Product exploration explored 100000 steps with 0 reset in 356 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 223 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 38 ms :[(NOT p0)]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1745993 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1745993 steps, saw 1215752 distinct states, run finished after 3002 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 02:59:53] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 02:59:53] [INFO ] Invariant cache hit.
[2023-03-12 02:59:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 02:59:54] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 02:59:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 02:59:54] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 02:59:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:54] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 02:59:54] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 02:59:54] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 19/19 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 17 transition count 14
Ensure Unique test removed 2 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t18 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 14 transition count 12
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 13 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 12 transition count 11
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 12 transition count 11
Applied a total of 10 rules in 9 ms. Remains 12 /17 variables (removed 5) and now considering 11/19 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 12/17 places, 11/19 transitions.
Incomplete random walk after 10241 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2321120 steps, run timeout after 3001 ms. (steps per millisecond=773 ) properties seen :{}
Probabilistic random walk after 2321120 steps, saw 1666895 distinct states, run finished after 3003 ms. (steps per millisecond=772 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-03-12 02:59:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 02:59:57] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-12 02:59:57] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 02:59:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 02:59:57] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 02:59:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 02:59:57] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 02:59:57] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 02:59:57] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20380 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=566 )
Parikh walk visited 1 properties in 35 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-12 02:59:57] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 17 cols
[2023-03-12 02:59:57] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 02:59:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 02:59:57] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 02:59:57] [INFO ] Invariant cache hit.
[2023-03-12 02:59:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 02:59:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-12 02:59:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 02:59:57] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 02:59:57] [INFO ] Invariant cache hit.
[2023-03-12 02:59:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 17/17 places, 19/19 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 108 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)]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3413 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2055835 steps, run timeout after 3001 ms. (steps per millisecond=685 ) properties seen :{}
Probabilistic random walk after 2055835 steps, saw 1439966 distinct states, run finished after 3001 ms. (steps per millisecond=685 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 03:00:00] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:00] [INFO ] Invariant cache hit.
[2023-03-12 03:00:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:00] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 03:00:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 03:00:00] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:00] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:00] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 03:00:00] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 19/19 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 17 transition count 14
Ensure Unique test removed 2 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t18 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 14 transition count 12
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 13 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 12 transition count 11
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 12 transition count 11
Applied a total of 10 rules in 8 ms. Remains 12 /17 variables (removed 5) and now considering 11/19 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 12/17 places, 11/19 transitions.
Incomplete random walk after 10241 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=5120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2055658 steps, run timeout after 3001 ms. (steps per millisecond=684 ) properties seen :{}
Probabilistic random walk after 2055658 steps, saw 1480526 distinct states, run finished after 3006 ms. (steps per millisecond=683 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-03-12 03:00:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 03:00:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 03:00:04] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 03:00:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:04] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 03:00:04] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:04] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 03:00:04] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20366 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=848 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 17 cols
[2023-03-12 03:00:04] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 03:00:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:04] [INFO ] Invariant cache hit.
[2023-03-12 03:00:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:04] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-12 03:00:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:04] [INFO ] Invariant cache hit.
[2023-03-12 03:00:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 17/17 places, 19/19 transitions.
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-08 finished in 15059 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 U p1))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Graph (trivial) has 11 edges and 26 vertex of which 9 / 26 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 transition count 21
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 21 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 17 transition count 19
Applied a total of 9 rules in 3 ms. Remains 17 /26 variables (removed 9) and now considering 19/29 (removed 10) transitions.
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:04] [INFO ] Invariant cache hit.
[2023-03-12 03:00:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:04] [INFO ] Invariant cache hit.
[2023-03-12 03:00:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-12 03:00:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:00:04] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-12 03:00:04] [INFO ] Invariant cache hit.
[2023-03-12 03:00:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/26 places, 19/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 17/26 places, 19/29 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s15 1)), p0:(AND (GEQ s0 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-10 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 26 cols
[2023-03-12 03:00:05] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 03:00:05] [INFO ] Implicit Places using invariants in 42 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 24/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 0 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-12 finished in 141 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((!p0||(G((!p1||G(p1))) U p2))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 03:00:05] [INFO ] Invariant cache hit.
[2023-03-12 03:00:05] [INFO ] Implicit Places using invariants in 31 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 29/29 transitions.
Applied a total of 0 rules in 2 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 36 ms. Remains : 25/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p1), false, (NOT p2), true]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LT s14 1), p2:(GEQ s15 1), p1:(AND (GEQ s19 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 1 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-13 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0 U !p1) U !p2)&&X(G(p3))))'
Support contains 8 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-12 03:00:05] [INFO ] Invariant cache hit.
[2023-03-12 03:00:05] [INFO ] Implicit Places using invariants in 30 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 24/26 places, 29/29 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p3) p2), true, p1, p2, (NOT p3)]
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(OR (LT s3 1) (LT s4 1)), p0:(LT s20 1), p3:(OR (LT s13 1) (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 0 ms.
FORMULA CloudOpsManagement-PT-20480by10240-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-15 finished in 345 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||G(!p1)||G((p2 U p3)))))))'
Found a Shortening insensitive property : CloudOpsManagement-PT-20480by10240-LTLFireability-07
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 29/29 transitions.
Graph (trivial) has 7 edges and 26 vertex of which 6 / 26 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 23 /26 variables (removed 3) and now considering 26/29 (removed 3) transitions.
[2023-03-12 03:00:06] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 23 cols
[2023-03-12 03:00:06] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 03:00:06] [INFO ] Implicit Places using invariants in 32 ms returned [15, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 21/26 places, 26/29 transitions.
Graph (trivial) has 8 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 1 ms. Remains 19 /21 variables (removed 2) and now considering 22/26 (removed 4) transitions.
[2023-03-12 03:00:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 19 cols
[2023-03-12 03:00:06] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 03:00:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 03:00:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:06] [INFO ] Invariant cache hit.
[2023-03-12 03:00:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 19/26 places, 22/29 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 109 ms. Remains : 19/26 places, 22/29 transitions.
Running random walk in product with property : CloudOpsManagement-PT-20480by10240-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s3 1) (LT s4 1)), p0:(GEQ s3 1), p3:(AND (GEQ s6 1) (GEQ s18 1)), p2:(GEQ s15 1)], nbAcceptance=2, 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 18368 reset in 187 ms.
Product exploration explored 100000 steps with 18428 reset in 218 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) p3 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))))]
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2560 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 03:00:07] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:07] [INFO ] Invariant cache hit.
[2023-03-12 03:00:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 03:00:07] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-12 03:00:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:07] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-12 03:00:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:07] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-12 03:00:07] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 03:00:07] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 394 ms.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19/19 places, 22/22 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 18
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 18
Applied a total of 5 rules in 4 ms. Remains 18 /19 variables (removed 1) and now considering 18/22 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 18/19 places, 18/22 transitions.
Incomplete random walk after 10241 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3413 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1979974 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :{}
Probabilistic random walk after 1979974 steps, saw 1557475 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 18 cols
[2023-03-12 03:00:10] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 03:00:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:11] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 03:00:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 03:00:11] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 03:00:11] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:11] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 03:00:11] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61443 steps, including 0 resets, run visited all 1 properties in 87 ms. (steps per millisecond=706 )
Parikh walk visited 1 properties in 87 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (G (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 p2 (NOT p0) (NOT p3))), (F (NOT (OR (AND p1 p2 (NOT p0)) (AND p1 (NOT p0) p3))))]
Knowledge based reduction with 9 factoid took 552 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 03:00:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 19 cols
[2023-03-12 03:00:12] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 03:00:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 03:00:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:12] [INFO ] Invariant cache hit.
[2023-03-12 03:00:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-12 03:00:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:12] [INFO ] Invariant cache hit.
[2023-03-12 03:00:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 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 : [(AND (NOT p0) (NOT p2) p3 p1), (X (OR p1 p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10241 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3413 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 03:00:12] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:12] [INFO ] Invariant cache hit.
[2023-03-12 03:00:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 03:00:12] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 03:00:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:12] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 03:00:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:12] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 03:00:12] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 03:00:12] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 380 ms.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19/19 places, 22/22 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 18
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 18 transition count 18
Applied a total of 5 rules in 3 ms. Remains 18 /19 variables (removed 1) and now considering 18/22 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 18/19 places, 18/22 transitions.
Incomplete random walk after 10241 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2560 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2124944 steps, run timeout after 3062 ms. (steps per millisecond=693 ) properties seen :{}
Probabilistic random walk after 2124944 steps, saw 1679875 distinct states, run finished after 3062 ms. (steps per millisecond=693 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 18 cols
[2023-03-12 03:00:16] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 03:00:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 03:00:16] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 03:00:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 03:00:16] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 03:00:16] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 03:00:16] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 03:00:16] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61443 steps, including 0 resets, run visited all 1 properties in 65 ms. (steps per millisecond=945 )
Parikh walk visited 1 properties in 65 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (OR p1 p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 395 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 18368 reset in 156 ms.
Product exploration explored 100000 steps with 18433 reset in 173 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 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-12 03:00:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:00:17] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 19 cols
[2023-03-12 03:00:17] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 03:00:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 19/19 places, 22/22 transitions.
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 03:00:18] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:18] [INFO ] Invariant cache hit.
[2023-03-12 03:00:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 03:00:18] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:18] [INFO ] Invariant cache hit.
[2023-03-12 03:00:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 03:00:18] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-12 03:00:18] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-12 03:00:18] [INFO ] Invariant cache hit.
[2023-03-12 03:00:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 19/19 places, 22/22 transitions.
Treatment of property CloudOpsManagement-PT-20480by10240-LTLFireability-07 finished in 12215 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)))'
[2023-03-12 03:00:18] [INFO ] Flatten gal took : 13 ms
[2023-03-12 03:00:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 03:00:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 29 transitions and 92 arcs took 1 ms.
Total runtime 39196 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1476/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1476/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudOpsManagement-PT-20480by10240-LTLFireability-07
Could not compute solution for formula : CloudOpsManagement-PT-20480by10240-LTLFireability-08
BK_STOP 1678590019655
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CloudOpsManagement-PT-20480by10240-LTLFireability-07
ltl formula formula --ltl=/tmp/1476/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 26 places, 29 transitions and 92 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.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1476/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1476/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1476/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1476/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 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:
malloc_consolidate(): invalid chunk size
ltl formula name CloudOpsManagement-PT-20480by10240-LTLFireability-08
ltl formula formula --ltl=/tmp/1476/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
pnml2lts-mc( 0/ 4): Petri net has 26 places, 29 transitions and 92 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1476/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1476/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1476/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1476/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
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-20480by10240"
export BK_EXAMINATION="LTLFireability"
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-20480by10240, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-20480by10240.tgz
mv CloudOpsManagement-PT-20480by10240 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;