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-171620522000343.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522000343
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716261566195

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:19:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:19:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:19:27] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-21 03:19:27] [INFO ] Transformed 556 places.
[2024-05-21 03:19:27] [INFO ] Transformed 684 transitions.
[2024-05-21 03:19:27] [INFO ] Found NUPN structural information;
[2024-05-21 03:19:27] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CloudDeployment-PT-2b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 129 place count 427 transition count 547
Iterating global reduction 1 with 126 rules applied. Total rules applied 255 place count 427 transition count 547
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 297 place count 385 transition count 505
Iterating global reduction 1 with 42 rules applied. Total rules applied 339 place count 385 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 341 place count 385 transition count 503
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 346 place count 380 transition count 498
Iterating global reduction 2 with 5 rules applied. Total rules applied 351 place count 380 transition count 498
Applied a total of 351 rules in 103 ms. Remains 380 /556 variables (removed 176) and now considering 498/684 (removed 186) transitions.
// Phase 1: matrix 498 rows 380 cols
[2024-05-21 03:19:28] [INFO ] Computed 6 invariants in 23 ms
[2024-05-21 03:19:28] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 03:19:28] [INFO ] Invariant cache hit.
[2024-05-21 03:19:28] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [8, 16, 184, 192]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 531 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 376/556 places, 498/684 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 376/556 places, 498/684 transitions.
Support contains 23 out of 376 places after structural reductions.
[2024-05-21 03:19:28] [INFO ] Flatten gal took : 67 ms
[2024-05-21 03:19:28] [INFO ] Flatten gal took : 29 ms
[2024-05-21 03:19:29] [INFO ] Input system was already deterministic with 498 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 498 rows 376 cols
[2024-05-21 03:19:29] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 03:19:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:30] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 03:19:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:30] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 03:19:31] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 230 ms.
[2024-05-21 03:19:31] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 8 properties in 33 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 498/498 transitions.
Graph (trivial) has 393 edges and 376 vertex of which 143 / 376 are part of one of the 16 SCC in 3 ms
Free SCC test removed 127 places
Drop transitions removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 641 edges and 249 vertex of which 245 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 245 transition count 218
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 224 place count 136 transition count 218
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 224 place count 136 transition count 198
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 264 place count 116 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 266 place count 114 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 114 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 114 transition count 194
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 112 transition count 194
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 2 with 66 rules applied. Total rules applied 338 place count 79 transition count 161
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 2 with 28 rules applied. Total rules applied 366 place count 65 transition count 193
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 376 place count 65 transition count 183
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 428 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 43 rules applied. Total rules applied 471 place count 44 transition count 107
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 472 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 474 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 476 place count 42 transition count 100
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 488 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 489 place count 41 transition count 87
Applied a total of 489 rules in 60 ms. Remains 41 /376 variables (removed 335) and now considering 87/498 (removed 411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 41/376 places, 87/498 transitions.
Finished random walk after 57 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 59 stabilizing places and 111 stable transitions
Graph (complete) has 862 edges and 376 vertex of which 372 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 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(p0) U G(p1)))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 371 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 371 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 370 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 370 transition count 492
Applied a total of 12 rules in 14 ms. Remains 370 /376 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 370 cols
[2024-05-21 03:19:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 03:19:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 03:19:31] [INFO ] Invariant cache hit.
[2024-05-21 03:19:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 03:19:31] [INFO ] Invariant cache hit.
[2024-05-21 03:19:32] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/376 places, 492/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 370/376 places, 492/498 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 288 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s255 1), p0:(NEQ s253 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 33295 reset in 327 ms.
Product exploration explored 100000 steps with 33380 reset in 274 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 856 edges and 370 vertex of which 366 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 123 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 156 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1145086 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 1145086 steps, saw 239487 distinct states, run finished after 3003 ms. (steps per millisecond=381 ) properties seen :4
Running SMT prover for 1 properties.
[2024-05-21 03:19:36] [INFO ] Invariant cache hit.
[2024-05-21 03:19:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:36] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 262 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 492/492 transitions.
Graph (trivial) has 384 edges and 370 vertex of which 142 / 370 are part of one of the 16 SCC in 3 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 686 edges and 244 vertex of which 240 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 239 transition count 248
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 142 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 141 transition count 247
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 198 place count 141 transition count 226
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 240 place count 120 transition count 226
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 314 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 338 place count 71 transition count 223
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 350 place count 71 transition count 211
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 375 place count 71 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 70 transition count 185
Applied a total of 376 rules in 47 ms. Remains 70 /370 variables (removed 300) and now considering 185/492 (removed 307) transitions.
[2024-05-21 03:19:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 70 cols
[2024-05-21 03:19:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 03:19:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 03:19:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 03:19:37] [INFO ] Invariant cache hit.
[2024-05-21 03:19:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:19:37] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-21 03:19:37] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-21 03:19:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 03:19:37] [INFO ] Invariant cache hit.
[2024-05-21 03:19:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/370 places, 185/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 70/370 places, 185/492 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 109 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 1020 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2839715 steps, run timeout after 3001 ms. (steps per millisecond=946 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 2839715 steps, saw 439438 distinct states, run finished after 3002 ms. (steps per millisecond=945 ) properties seen :4
Running SMT prover for 1 properties.
[2024-05-21 03:19:41] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-21 03:19:41] [INFO ] Invariant cache hit.
[2024-05-21 03:19:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:41] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 284 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 9672 reset in 266 ms.
Product exploration explored 100000 steps with 9709 reset in 205 ms.
Built C files in :
/tmp/ltsmin7471070025677264822
[2024-05-21 03:19:42] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 03:19:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:19:42] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 03:19:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:19:42] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 03:19:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:19:42] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7471070025677264822
Running compilation step : cd /tmp/ltsmin7471070025677264822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin7471070025677264822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7471070025677264822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13784530930695129011.hoa' '--buchi-type=spotba'
LTSmin run took 1038 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-00 finished in 12841 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((p0||X((G((p0||X(G(p1)))) U (p0&&G((p0||X(G(p1))))))))))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 371 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 371 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 370 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 370 transition count 492
Applied a total of 12 rules in 18 ms. Remains 370 /376 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 370 cols
[2024-05-21 03:19:44] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 03:19:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 03:19:44] [INFO ] Invariant cache hit.
[2024-05-21 03:19:44] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-21 03:19:44] [INFO ] Invariant cache hit.
[2024-05-21 03:19:44] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/376 places, 492/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 370/376 places, 492/498 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s328 1), p1:(EQ s361 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-02 finished in 908 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(X(X(F((p0&&F(p1))))))))'
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 371 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 371 transition count 493
Applied a total of 10 rules in 15 ms. Remains 371 /376 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 371 cols
[2024-05-21 03:19:45] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 03:19:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 03:19:45] [INFO ] Invariant cache hit.
[2024-05-21 03:19:45] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-21 03:19:45] [INFO ] Invariant cache hit.
[2024-05-21 03:19:45] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/376 places, 493/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 371/376 places, 493/498 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(OR (EQ s199 0) (EQ s309 0)), p0:(EQ s327 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 153 ms.
Product exploration explored 100000 steps with 20000 reset in 158 ms.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/371 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 155 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1249843 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1249843 steps, saw 258379 distinct states, run finished after 3002 ms. (steps per millisecond=416 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:19:49] [INFO ] Invariant cache hit.
[2024-05-21 03:19:49] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:19:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:50] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:19:50] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 03:19:50] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 493/493 transitions.
Graph (trivial) has 388 edges and 371 vertex of which 142 / 371 are part of one of the 16 SCC in 2 ms
Free SCC test removed 126 places
Drop transitions removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 637 edges and 245 vertex of which 241 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 214 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 214 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 258 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 260 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 262 place count 113 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 330 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 358 place count 65 transition count 197
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 65 transition count 183
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 404 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 424 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 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 3 with 43 rules applied. Total rules applied 467 place count 44 transition count 107
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 468 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 470 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 472 place count 42 transition count 100
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 484 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 485 place count 41 transition count 87
Applied a total of 485 rules in 41 ms. Remains 41 /371 variables (removed 330) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 41/371 places, 87/493 transitions.
Finished random walk after 233 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=116 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 282 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 493/493 transitions.
Applied a total of 0 rules in 4 ms. Remains 371 /371 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-21 03:19:50] [INFO ] Invariant cache hit.
[2024-05-21 03:19:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 03:19:51] [INFO ] Invariant cache hit.
[2024-05-21 03:19:51] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 03:19:51] [INFO ] Invariant cache hit.
[2024-05-21 03:19:51] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 371/371 places, 493/493 transitions.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/371 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 157 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1291678 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1291678 steps, saw 264356 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-21 03:19:54] [INFO ] Invariant cache hit.
[2024-05-21 03:19:55] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:19:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:19:55] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:19:55] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-21 03:19:55] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 493/493 transitions.
Graph (trivial) has 388 edges and 371 vertex of which 142 / 371 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 637 edges and 245 vertex of which 241 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 214 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 214 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 258 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 260 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 262 place count 113 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 330 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 358 place count 65 transition count 197
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 65 transition count 183
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 404 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 424 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 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 3 with 43 rules applied. Total rules applied 467 place count 44 transition count 107
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 468 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 470 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 472 place count 42 transition count 100
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 484 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 485 place count 41 transition count 87
Applied a total of 485 rules in 34 ms. Remains 41 /371 variables (removed 330) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 41/371 places, 87/493 transitions.
Finished random walk after 36 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 158 ms.
Product exploration explored 100000 steps with 20000 reset in 162 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 371 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 371/371 places, 493/493 transitions.
Graph (trivial) has 385 edges and 371 vertex of which 133 / 371 are part of one of the 15 SCC in 2 ms
Free SCC test removed 118 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (complete) has 703 edges and 253 vertex of which 249 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 249 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 249 transition count 355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 108 place count 249 transition count 368
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 123 place count 249 transition count 368
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 179 place count 193 transition count 312
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 235 place count 193 transition count 312
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 276 place count 193 transition count 312
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 307 place count 162 transition count 281
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 338 place count 162 transition count 281
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 353 place count 162 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 355 place count 162 transition count 369
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 372 place count 145 transition count 315
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 389 place count 145 transition count 315
Deduced a syphon composed of 72 places in 0 ms
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 419 place count 145 transition count 285
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 423 place count 141 transition count 281
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 427 place count 141 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 429 place count 141 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 433 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 437 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 450 place count 137 transition count 282
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 450 rules in 59 ms. Remains 137 /371 variables (removed 234) and now considering 282/493 (removed 211) transitions.
[2024-05-21 03:19:57] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-21 03:19:57] [INFO ] Flow matrix only has 248 transitions (discarded 34 similar events)
// Phase 1: matrix 248 rows 137 cols
[2024-05-21 03:19:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/371 places, 282/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 137/371 places, 282/493 transitions.
Built C files in :
/tmp/ltsmin12463852366925277085
[2024-05-21 03:19:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12463852366925277085
Running compilation step : cd /tmp/ltsmin12463852366925277085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin12463852366925277085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12463852366925277085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6868741069297245623.hoa' '--buchi-type=spotba'
LTSmin run took 202 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-05 finished in 12809 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(p0)&&X(G(p1)))))'
Support contains 6 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 371 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 371 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 370 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 370 transition count 492
Applied a total of 12 rules in 17 ms. Remains 370 /376 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 370 cols
[2024-05-21 03:19:58] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 03:19:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 03:19:58] [INFO ] Invariant cache hit.
[2024-05-21 03:19:58] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-05-21 03:19:58] [INFO ] Invariant cache hit.
[2024-05-21 03:19:58] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/376 places, 492/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 370/376 places, 492/498 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s305 1) (AND (EQ s183 1) (EQ s199 1) (EQ s258 1) (EQ s358 1) (EQ s366 1))), p0:(EQ s305 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-08 finished in 676 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&&X((p0 U (p1||G(p0))))))))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 371 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 371 transition count 493
Applied a total of 10 rules in 20 ms. Remains 371 /376 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 371 cols
[2024-05-21 03:19:58] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 03:19:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 03:19:58] [INFO ] Invariant cache hit.
[2024-05-21 03:19:59] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 03:19:59] [INFO ] Invariant cache hit.
[2024-05-21 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/376 places, 493/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 371/376 places, 493/498 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s12 1), p1:(NEQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33278 reset in 190 ms.
Product exploration explored 100000 steps with 33379 reset in 190 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 155 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Finished Best-First random walk after 2602 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1301 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 371/371 places, 493/493 transitions.
Applied a total of 0 rules in 5 ms. Remains 371 /371 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-21 03:20:00] [INFO ] Invariant cache hit.
[2024-05-21 03:20:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 03:20:00] [INFO ] Invariant cache hit.
[2024-05-21 03:20:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 03:20:00] [INFO ] Invariant cache hit.
[2024-05-21 03:20:01] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 371/371 places, 493/493 transitions.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Finished Best-First random walk after 2494 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1247 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33379 reset in 185 ms.
Product exploration explored 100000 steps with 33445 reset in 187 ms.
Built C files in :
/tmp/ltsmin13105204302409313270
[2024-05-21 03:20:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13105204302409313270
Running compilation step : cd /tmp/ltsmin13105204302409313270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 675 ms.
Running link step : cd /tmp/ltsmin13105204302409313270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13105204302409313270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15796127833844047697.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-10 finished in 4415 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((p0||G(F((p1||G(p2)))))))'
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 371 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 371 transition count 493
Applied a total of 10 rules in 17 ms. Remains 371 /376 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 371 cols
[2024-05-21 03:20:03] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 03:20:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 03:20:03] [INFO ] Invariant cache hit.
[2024-05-21 03:20:03] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 03:20:03] [INFO ] Invariant cache hit.
[2024-05-21 03:20:03] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/376 places, 493/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 371/376 places, 493/498 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s246 0), p2:(EQ s317 1), p1:(AND (EQ s344 0) (EQ s317 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLFireability-11 finished in 1219 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((p0&&G(F(p0))))))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 371 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 371 transition count 493
Applied a total of 10 rules in 17 ms. Remains 371 /376 variables (removed 5) and now considering 493/498 (removed 5) transitions.
[2024-05-21 03:20:04] [INFO ] Invariant cache hit.
[2024-05-21 03:20:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 03:20:04] [INFO ] Invariant cache hit.
[2024-05-21 03:20:04] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-21 03:20:04] [INFO ] Invariant cache hit.
[2024-05-21 03:20:04] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/376 places, 493/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 371/376 places, 493/498 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s246 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1580 reset in 106 ms.
Product exploration explored 100000 steps with 1547 reset in 124 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 857 edges and 371 vertex of which 367 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 169 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 169457 steps, run visited all 1 properties in 410 ms. (steps per millisecond=413 )
Probabilistic random walk after 169457 steps, saw 39867 distinct states, run finished after 410 ms. (steps per millisecond=413 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 371 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 371/371 places, 493/493 transitions.
Graph (trivial) has 387 edges and 371 vertex of which 142 / 371 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 688 edges and 245 vertex of which 241 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 240 transition count 246
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 204 place count 139 transition count 246
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 204 place count 139 transition count 225
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 246 place count 118 transition count 225
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 2 with 74 rules applied. Total rules applied 320 place count 81 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 344 place count 69 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 69 transition count 210
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 381 place count 69 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 68 transition count 184
Applied a total of 382 rules in 30 ms. Remains 68 /371 variables (removed 303) and now considering 184/493 (removed 309) transitions.
[2024-05-21 03:20:06] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 68 cols
[2024-05-21 03:20:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 03:20:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 03:20:06] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 03:20:06] [INFO ] Invariant cache hit.
[2024-05-21 03:20:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:20:06] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-21 03:20:06] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-21 03:20:06] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 03:20:06] [INFO ] Invariant cache hit.
[2024-05-21 03:20:06] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/371 places, 184/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 68/371 places, 184/493 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1034 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1943 steps, run visited all 1 properties in 18 ms. (steps per millisecond=107 )
Probabilistic random walk after 1943 steps, saw 613 distinct states, run finished after 19 ms. (steps per millisecond=102 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9688 reset in 138 ms.
Stuttering criterion allowed to conclude after 4596 steps with 457 reset in 7 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-12 finished in 2867 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)))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Graph (trivial) has 392 edges and 376 vertex of which 143 / 376 are part of one of the 16 SCC in 2 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 691 edges and 249 vertex of which 245 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 244 transition count 246
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 140 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 139 transition count 245
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 212 place count 139 transition count 226
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 250 place count 120 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 119 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 119 transition count 225
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 326 place count 82 transition count 188
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 3 with 24 rules applied. Total rules applied 350 place count 70 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 356 place count 70 transition count 210
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 70 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 69 transition count 184
Applied a total of 382 rules in 31 ms. Remains 69 /376 variables (removed 307) and now considering 184/498 (removed 314) transitions.
[2024-05-21 03:20:07] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 69 cols
[2024-05-21 03:20:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 03:20:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 03:20:07] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 03:20:07] [INFO ] Invariant cache hit.
[2024-05-21 03:20:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:20:07] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-21 03:20:07] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-21 03:20:07] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-21 03:20:07] [INFO ] Invariant cache hit.
[2024-05-21 03:20:07] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/376 places, 184/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 69/376 places, 184/498 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-13 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:(EQ s49 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 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-13 finished in 441 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 6 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Graph (trivial) has 384 edges and 376 vertex of which 134 / 376 are part of one of the 15 SCC in 1 ms
Free SCC test removed 119 places
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 707 edges and 257 vertex of which 253 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 253 transition count 254
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 217 place count 147 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 219 place count 145 transition count 251
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 219 place count 145 transition count 232
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 257 place count 126 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 125 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 125 transition count 231
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 339 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 363 place count 73 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 369 place count 73 transition count 214
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 388 place count 73 transition count 195
Applied a total of 388 rules in 30 ms. Remains 73 /376 variables (removed 303) and now considering 195/498 (removed 303) transitions.
[2024-05-21 03:20:07] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
// Phase 1: matrix 157 rows 73 cols
[2024-05-21 03:20:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 03:20:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 03:20:07] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:07] [INFO ] Invariant cache hit.
[2024-05-21 03:20:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 03:20:07] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-21 03:20:08] [INFO ] Redundant transitions in 96 ms returned []
[2024-05-21 03:20:08] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:08] [INFO ] Invariant cache hit.
[2024-05-21 03:20:08] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/376 places, 195/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 73/376 places, 195/498 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s40 0) (EQ s53 0) (EQ s66 0) (EQ s71 0) (EQ s29 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 7555 reset in 158 ms.
Product exploration explored 100000 steps with 7450 reset in 161 ms.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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)]
Incomplete random walk after 10000 steps, including 787 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2749962 steps, run timeout after 3001 ms. (steps per millisecond=916 ) properties seen :{}
Probabilistic random walk after 2749962 steps, saw 404901 distinct states, run finished after 3001 ms. (steps per millisecond=916 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:20:11] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:11] [INFO ] Invariant cache hit.
[2024-05-21 03:20:11] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:20:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 03:20:11] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:20:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 03:20:11] [INFO ] After 15ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:20:11] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 03:20:11] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 195/195 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 73 transition count 174
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 69 transition count 188
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 69 transition count 186
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 69 transition count 176
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 56 place count 69 transition count 161
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 84 place count 54 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 50 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 50 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 50 transition count 135
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 50 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 50 transition count 132
Applied a total of 98 rules in 18 ms. Remains 50 /73 variables (removed 23) and now considering 132/195 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 50/73 places, 132/195 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 159633 steps, run visited all 1 properties in 171 ms. (steps per millisecond=933 )
Probabilistic random walk after 159633 steps, saw 26413 distinct states, run finished after 172 ms. (steps per millisecond=928 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 195/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-21 03:20:12] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:12] [INFO ] Invariant cache hit.
[2024-05-21 03:20:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 03:20:12] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:12] [INFO ] Invariant cache hit.
[2024-05-21 03:20:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 03:20:12] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-21 03:20:12] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-21 03:20:12] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:12] [INFO ] Invariant cache hit.
[2024-05-21 03:20:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 73/73 places, 195/195 transitions.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 774 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2932434 steps, run timeout after 3001 ms. (steps per millisecond=977 ) properties seen :{}
Probabilistic random walk after 2932434 steps, saw 430369 distinct states, run finished after 3001 ms. (steps per millisecond=977 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:20:15] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-21 03:20:15] [INFO ] Invariant cache hit.
[2024-05-21 03:20:15] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:20:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 03:20:15] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:20:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 03:20:15] [INFO ] After 15ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:20:15] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-21 03:20:15] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 195/195 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 73 transition count 174
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 69 transition count 188
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 69 transition count 186
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 69 transition count 176
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 56 place count 69 transition count 161
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 84 place count 54 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 50 transition count 137
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 50 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 50 transition count 135
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 50 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 50 transition count 132
Applied a total of 98 rules in 28 ms. Remains 50 /73 variables (removed 23) and now considering 132/195 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 50/73 places, 132/195 transitions.
Incomplete random walk after 10000 steps, including 387 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 159633 steps, run visited all 1 properties in 164 ms. (steps per millisecond=973 )
Probabilistic random walk after 159633 steps, saw 26413 distinct states, run finished after 164 ms. (steps per millisecond=973 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7508 reset in 156 ms.
Product exploration explored 100000 steps with 7460 reset in 163 ms.
Built C files in :
/tmp/ltsmin6901225434152209188
[2024-05-21 03:20:16] [INFO ] Computing symmetric may disable matrix : 195 transitions.
[2024-05-21 03:20:16] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:20:16] [INFO ] Computing symmetric may enable matrix : 195 transitions.
[2024-05-21 03:20:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:20:16] [INFO ] Computing Do-Not-Accords matrix : 195 transitions.
[2024-05-21 03:20:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:20:16] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6901225434152209188
Running compilation step : cd /tmp/ltsmin6901225434152209188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin6901225434152209188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6901225434152209188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8769844457055135795.hoa' '--buchi-type=spotba'
LTSmin run took 395 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLFireability-14 finished in 9752 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((F(G(p0))&&(X(p1)||G(p2))))))'
Support contains 7 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 371 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 371 transition count 493
Applied a total of 10 rules in 16 ms. Remains 371 /376 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 371 cols
[2024-05-21 03:20:17] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 03:20:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 03:20:17] [INFO ] Invariant cache hit.
[2024-05-21 03:20:17] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-21 03:20:17] [INFO ] Invariant cache hit.
[2024-05-21 03:20:18] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/376 places, 493/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 371/376 places, 493/498 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s183 1) (EQ s199 1) (EQ s320 1) (EQ s359 1) (EQ s367 1)), p2:(EQ s27 0), p1:(EQ s281 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-15 finished in 703 ms.
All properties solved by simple procedures.
Total runtime 50638 ms.

BK_STOP 1716261619439

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 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 r087-tall-171620522000343"
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 [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;