Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620522000342.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CloudDeployment-PT-2b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522000342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 166K May 18 16:42 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 CloudDeployment-PT-2b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716261540631

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 03:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:19:02] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-21 03:19:02] [INFO ] Transformed 556 places.
[2024-05-21 03:19:02] [INFO ] Transformed 684 transitions.
[2024-05-21 03:19:02] [INFO ] Found NUPN structural information;
[2024-05-21 03:19:02] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudDeployment-PT-2b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 553 transition count 684
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 122 place count 434 transition count 554
Iterating global reduction 1 with 119 rules applied. Total rules applied 241 place count 434 transition count 554
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 280 place count 395 transition count 515
Iterating global reduction 1 with 39 rules applied. Total rules applied 319 place count 395 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 320 place count 395 transition count 514
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 325 place count 390 transition count 509
Iterating global reduction 2 with 5 rules applied. Total rules applied 330 place count 390 transition count 509
Applied a total of 330 rules in 97 ms. Remains 390 /556 variables (removed 166) and now considering 509/684 (removed 175) transitions.
// Phase 1: matrix 509 rows 390 cols
[2024-05-21 03:19:02] [INFO ] Computed 6 invariants in 22 ms
[2024-05-21 03:19:02] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 03:19:02] [INFO ] Invariant cache hit.
[2024-05-21 03:19:03] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [192]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 555 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 389/556 places, 509/684 transitions.
Applied a total of 0 rules in 14 ms. Remains 389 /389 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 667 ms. Remains : 389/556 places, 509/684 transitions.
Support contains 28 out of 389 places after structural reductions.
[2024-05-21 03:19:03] [INFO ] Flatten gal took : 66 ms
[2024-05-21 03:19:03] [INFO ] Flatten gal took : 30 ms
[2024-05-21 03:19:03] [INFO ] Input system was already deterministic with 509 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 509 rows 389 cols
[2024-05-21 03:19:04] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 03:19:04] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:19:04] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 03:19:04] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:19:05] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 151 ms.
[2024-05-21 03:19:05] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 42 ms.
Support contains 4 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 396 edges and 389 vertex of which 139 / 389 are part of one of the 15 SCC in 3 ms
Free SCC test removed 124 places
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Graph (complete) has 695 edges and 265 vertex of which 257 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 257 transition count 233
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 227 place count 149 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 148 transition count 232
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 228 place count 148 transition count 211
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 270 place count 127 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 275 place count 122 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 280 place count 122 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 280 place count 122 transition count 202
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 288 place count 118 transition count 202
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 354 place count 85 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 85 transition count 168
Performed 14 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 383 place count 71 transition count 202
Drop transitions removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 71 transition count 196
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 407 place count 71 transition count 178
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 425 place count 71 transition count 160
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 281 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 38 rules applied. Total rules applied 463 place count 52 transition count 141
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 464 place count 52 transition count 140
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 466 place count 50 transition count 133
Iterating global reduction 7 with 2 rules applied. Total rules applied 468 place count 50 transition count 133
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 474 place count 50 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 475 place count 49 transition count 126
Applied a total of 475 rules in 78 ms. Remains 49 /389 variables (removed 340) and now considering 126/509 (removed 383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 49/389 places, 126/509 transitions.
Finished random walk after 1205 steps, including 32 resets, run visited all 3 properties in 9 ms. (steps per millisecond=133 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 59 stabilizing places and 112 stable transitions
Graph (complete) has 900 edges and 389 vertex of which 381 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p1)||p0) U p2)))'
Support contains 4 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 401 edges and 389 vertex of which 146 / 389 are part of one of the 16 SCC in 1 ms
Free SCC test removed 130 places
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 736 edges and 259 vertex of which 251 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 250 transition count 252
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 145 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 144 transition count 251
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 214 place count 144 transition count 234
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 248 place count 127 transition count 234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 124 transition count 231
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 124 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 254 place count 124 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 122 transition count 229
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 332 place count 85 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 357 place count 73 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 363 place count 73 transition count 213
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 383 place count 73 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 72 transition count 192
Applied a total of 384 rules in 53 ms. Remains 72 /389 variables (removed 317) and now considering 192/509 (removed 317) transitions.
[2024-05-21 03:19:05] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
// Phase 1: matrix 153 rows 72 cols
[2024-05-21 03:19:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 03:19:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 03:19:05] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
[2024-05-21 03:19:05] [INFO ] Invariant cache hit.
[2024-05-21 03:19:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-21 03:19:05] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-21 03:19:05] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
[2024-05-21 03:19:05] [INFO ] Invariant cache hit.
[2024-05-21 03:19:06] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/389 places, 192/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 72/389 places, 192/509 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 261 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s4 0) (EQ s18 1)), p0:(OR (EQ s56 0) (EQ s60 1)), p1:(OR (EQ s56 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-03 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 377 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 377 transition count 496
Applied a total of 25 rules in 29 ms. Remains 377 /389 variables (removed 12) and now considering 496/509 (removed 13) transitions.
// Phase 1: matrix 496 rows 377 cols
[2024-05-21 03:19:06] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 03:19:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 03:19:06] [INFO ] Invariant cache hit.
[2024-05-21 03:19:06] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-21 03:19:06] [INFO ] Invariant cache hit.
[2024-05-21 03:19:06] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 496/509 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 377/389 places, 496/509 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s164 0) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-05 finished in 686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G((F(p1)||p2))||p0)))'
Support contains 5 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Applied a total of 23 rules in 15 ms. Remains 378 /389 variables (removed 11) and now considering 497/509 (removed 12) transitions.
// Phase 1: matrix 497 rows 378 cols
[2024-05-21 03:19:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 03:19:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 03:19:07] [INFO ] Invariant cache hit.
[2024-05-21 03:19:07] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-21 03:19:07] [INFO ] Invariant cache hit.
[2024-05-21 03:19:07] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/389 places, 497/509 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 378/389 places, 497/509 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s202 1), p2:(OR (EQ s114 0) (EQ s360 1)), p0:(OR (EQ s89 0) (EQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 56 stabilizing places and 109 stable transitions
Graph (complete) has 885 edges and 378 vertex of which 370 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 56 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLCardinality-07 finished in 1397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p1))||p0)) U ((!p2&&X(p2))||X(G(p2)))))'
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 377 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 377 transition count 497
Applied a total of 24 rules in 19 ms. Remains 377 /389 variables (removed 12) and now considering 497/509 (removed 12) transitions.
// Phase 1: matrix 497 rows 377 cols
[2024-05-21 03:19:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 03:19:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 03:19:08] [INFO ] Invariant cache hit.
[2024-05-21 03:19:08] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-21 03:19:08] [INFO ] Invariant cache hit.
[2024-05-21 03:19:08] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 497/509 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 377/389 places, 497/509 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s78 0) (EQ s132 1)), p0:(OR (EQ s32 0) (EQ s22 1)), p1:(OR (EQ s239 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33280 reset in 219 ms.
Product exploration explored 100000 steps with 33377 reset in 217 ms.
Computed a total of 56 stabilizing places and 109 stable transitions
Graph (complete) has 886 edges and 377 vertex of which 369 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Computed a total of 56 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 157 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 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 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 03:19:10] [INFO ] Invariant cache hit.
[2024-05-21 03:19:10] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:19:10] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:10] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 03:19:10] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-21 03:19:10] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 11 ms.
Support contains 6 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 497/497 transitions.
Graph (trivial) has 381 edges and 377 vertex of which 128 / 377 are part of one of the 15 SCC in 1 ms
Free SCC test removed 113 places
Drop transitions removed 146 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 147 transitions.
Graph (complete) has 684 edges and 264 vertex of which 256 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 256 transition count 239
Reduce places removed 103 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 217 place count 153 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 152 transition count 238
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 218 place count 152 transition count 214
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 266 place count 128 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 126 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 126 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 270 place count 126 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 274 place count 124 transition count 210
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 344 place count 89 transition count 175
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 372 place count 75 transition count 214
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 386 place count 75 transition count 200
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 419 place count 75 transition count 167
Free-agglomeration rule applied 18 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 437 place count 75 transition count 148
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 251 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 37 rules applied. Total rules applied 474 place count 56 transition count 130
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 475 place count 56 transition count 129
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 476 place count 55 transition count 126
Iterating global reduction 6 with 1 rules applied. Total rules applied 477 place count 55 transition count 126
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 485 place count 55 transition count 118
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 488 place count 55 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 489 place count 54 transition count 117
Applied a total of 489 rules in 59 ms. Remains 54 /377 variables (removed 323) and now considering 117/497 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 54/377 places, 117/497 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:19:11] [INFO ] Flow matrix only has 85 transitions (discarded 32 similar events)
// Phase 1: matrix 85 rows 54 cols
[2024-05-21 03:19:11] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 03:19:11] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:19:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 03:19:11] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:11] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:19:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:19:11] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:19:11] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 03:19:11] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 54/54 places, 117/117 transitions.
Finished random walk after 6738 steps, including 2 resets, run visited all 2 properties in 63 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p0 p2 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 6 out of 377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 377/377 places, 497/497 transitions.
Graph (trivial) has 381 edges and 377 vertex of which 128 / 377 are part of one of the 15 SCC in 1 ms
Free SCC test removed 113 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Graph (complete) has 733 edges and 264 vertex of which 256 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 255 transition count 263
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 154 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 153 transition count 262
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 206 place count 153 transition count 240
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 250 place count 131 transition count 240
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 330 place count 91 transition count 200
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 356 place count 78 transition count 238
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 368 place count 78 transition count 226
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 395 place count 78 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 77 transition count 198
Applied a total of 396 rules in 38 ms. Remains 77 /377 variables (removed 300) and now considering 198/497 (removed 299) transitions.
[2024-05-21 03:19:11] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
// Phase 1: matrix 158 rows 77 cols
[2024-05-21 03:19:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 03:19:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 03:19:12] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 03:19:12] [INFO ] Invariant cache hit.
[2024-05-21 03:19:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:12] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 03:19:12] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-21 03:19:12] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 03:19:12] [INFO ] Invariant cache hit.
[2024-05-21 03:19:12] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/377 places, 198/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 77/377 places, 198/497 transitions.
Computed a total of 21 stabilizing places and 101 stable transitions
Computed a total of 21 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 953 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 03:19:12] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 03:19:12] [INFO ] Invariant cache hit.
[2024-05-21 03:19:12] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 03:19:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 03:19:12] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 03:19:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:12] [INFO ] After 23ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-21 03:19:12] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 03:19:13] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 198/198 transitions.
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 77 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 74 transition count 188
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 74 transition count 185
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 74 transition count 170
Free-agglomeration rule applied 18 times with reduction of 1 identical transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 74 transition count 151
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 242 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 37 rules applied. Total rules applied 102 place count 55 transition count 133
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 55 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 54 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 54 transition count 129
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 54 transition count 121
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 54 transition count 121
Applied a total of 116 rules in 32 ms. Remains 54 /77 variables (removed 23) and now considering 121/198 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 54/77 places, 121/198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:19:13] [INFO ] Flow matrix only has 89 transitions (discarded 32 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-21 03:19:13] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 03:19:13] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:19:13] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:13] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:19:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:19:13] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:19:13] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-21 03:19:13] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 54/54 places, 121/121 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3129 steps, run visited all 2 properties in 20 ms. (steps per millisecond=156 )
Probabilistic random walk after 3129 steps, saw 994 distinct states, run finished after 20 ms. (steps per millisecond=156 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p0 p2 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 14 factoid took 429 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 9374 reset in 197 ms.
Stuttering criterion allowed to conclude after 13668 steps with 1256 reset in 33 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-09 finished in 6248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1) U G((!p2&&X(p3))))&&p0)))'
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 377 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 377 transition count 496
Applied a total of 25 rules in 17 ms. Remains 377 /389 variables (removed 12) and now considering 496/509 (removed 13) transitions.
// Phase 1: matrix 496 rows 377 cols
[2024-05-21 03:19:14] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 03:19:14] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 03:19:14] [INFO ] Invariant cache hit.
[2024-05-21 03:19:15] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-21 03:19:15] [INFO ] Invariant cache hit.
[2024-05-21 03:19:15] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 496/509 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 377/389 places, 496/509 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p3) p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}, { cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s236 0)), p2:(OR (EQ s185 0) (EQ s205 1)), p1:(EQ s29 1), p3:(OR (EQ s272 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-10 finished in 964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 398 edges and 389 vertex of which 137 / 389 are part of one of the 15 SCC in 1 ms
Free SCC test removed 122 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (complete) has 747 edges and 267 vertex of which 259 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 258 transition count 258
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 150 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 149 transition count 256
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 221 place count 149 transition count 237
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 259 place count 130 transition count 237
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 264 place count 125 transition count 232
Iterating global reduction 3 with 5 rules applied. Total rules applied 269 place count 125 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 269 place count 125 transition count 230
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 273 place count 123 transition count 230
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 349 place count 85 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 374 place count 73 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 380 place count 73 transition count 213
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 394 place count 73 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 395 place count 72 transition count 198
Applied a total of 395 rules in 28 ms. Remains 72 /389 variables (removed 317) and now considering 198/509 (removed 311) transitions.
[2024-05-21 03:19:15] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
// Phase 1: matrix 160 rows 72 cols
[2024-05-21 03:19:15] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 03:19:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 03:19:15] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
[2024-05-21 03:19:15] [INFO ] Invariant cache hit.
[2024-05-21 03:19:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-21 03:19:15] [INFO ] Redundant transitions in 93 ms returned []
[2024-05-21 03:19:15] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
[2024-05-21 03:19:15] [INFO ] Invariant cache hit.
[2024-05-21 03:19:15] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/389 places, 198/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 72/389 places, 198/509 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-11 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 (EQ s10 1) (OR (EQ s55 0) (EQ s65 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 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-11 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 401 edges and 389 vertex of which 135 / 389 are part of one of the 16 SCC in 1 ms
Free SCC test removed 119 places
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Graph (complete) has 752 edges and 270 vertex of which 262 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 261 transition count 265
Reduce places removed 106 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 155 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 154 transition count 264
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 216 place count 154 transition count 244
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 256 place count 134 transition count 244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 130 transition count 240
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 130 transition count 240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 264 place count 130 transition count 238
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 268 place count 128 transition count 238
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 348 place count 88 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 88 transition count 197
Performed 14 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 377 place count 74 transition count 230
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 386 place count 74 transition count 221
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 409 place count 74 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 410 place count 73 transition count 197
Applied a total of 410 rules in 28 ms. Remains 73 /389 variables (removed 316) and now considering 197/509 (removed 312) transitions.
[2024-05-21 03:19:16] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
// Phase 1: matrix 160 rows 73 cols
[2024-05-21 03:19:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 03:19:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 03:19:16] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
[2024-05-21 03:19:16] [INFO ] Invariant cache hit.
[2024-05-21 03:19:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 03:19:16] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-21 03:19:16] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
[2024-05-21 03:19:16] [INFO ] Invariant cache hit.
[2024-05-21 03:19:16] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/389 places, 197/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 73/389 places, 197/509 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s25 0) (EQ s51 1)), p0:(EQ s56 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 2288 steps with 221 reset in 7 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-15 finished in 462 ms.
All properties solved by simple procedures.
Total runtime 14210 ms.

BK_STOP 1716261557463

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-2b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-2b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620522000342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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