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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 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 308K 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-3b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716261736979

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-3b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 03:22:18] [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:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:22:18] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 03:22:18] [INFO ] Transformed 859 places.
[2024-05-21 03:22:18] [INFO ] Transformed 1152 transitions.
[2024-05-21 03:22:18] [INFO ] Found NUPN structural information;
[2024-05-21 03:22:18] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-3b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 856 transition count 1152
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 198 place count 661 transition count 957
Iterating global reduction 1 with 195 rules applied. Total rules applied 393 place count 661 transition count 957
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 459 place count 595 transition count 891
Iterating global reduction 1 with 66 rules applied. Total rules applied 525 place count 595 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 529 place count 595 transition count 887
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 535 place count 589 transition count 881
Iterating global reduction 2 with 6 rules applied. Total rules applied 541 place count 589 transition count 881
Applied a total of 541 rules in 246 ms. Remains 589 /859 variables (removed 270) and now considering 881/1152 (removed 271) transitions.
// Phase 1: matrix 881 rows 589 cols
[2024-05-21 03:22:19] [INFO ] Computed 10 invariants in 28 ms
[2024-05-21 03:22:19] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 03:22:19] [INFO ] Invariant cache hit.
[2024-05-21 03:22:19] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-05-21 03:22:19] [INFO ] Invariant cache hit.
[2024-05-21 03:22:20] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/859 places, 881/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 589/859 places, 881/1152 transitions.
Support contains 53 out of 589 places after structural reductions.
[2024-05-21 03:22:20] [INFO ] Flatten gal took : 110 ms
[2024-05-21 03:22:20] [INFO ] Flatten gal took : 66 ms
[2024-05-21 03:22:20] [INFO ] Input system was already deterministic with 881 transitions.
Support contains 51 out of 589 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 30) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-21 03:22:21] [INFO ] Invariant cache hit.
[2024-05-21 03:22:21] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-21 03:22:21] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-21 03:22:22] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-21 03:22:23] [INFO ] After 894ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-05-21 03:22:24] [INFO ] After 1947ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 621 ms.
[2024-05-21 03:22:24] [INFO ] After 3049ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 16 properties in 131 ms.
Support contains 8 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 590 edges and 589 vertex of which 198 / 589 are part of one of the 21 SCC in 5 ms
Free SCC test removed 177 places
Drop transitions removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Graph (complete) has 1248 edges and 412 vertex of which 393 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 393 transition count 420
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 169 rules applied. Total rules applied 343 place count 229 transition count 415
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 347 place count 225 transition count 415
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 347 place count 225 transition count 384
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 409 place count 194 transition count 384
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 418 place count 185 transition count 375
Iterating global reduction 3 with 9 rules applied. Total rules applied 427 place count 185 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 428 place count 185 transition count 374
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 428 place count 185 transition count 367
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 442 place count 178 transition count 367
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 552 place count 123 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 123 transition count 310
Performed 21 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 595 place count 102 transition count 388
Drop transitions removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 610 place count 102 transition count 373
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 6 with 35 rules applied. Total rules applied 645 place count 102 transition count 338
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 665 place count 102 transition count 318
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 707 place count 82 transition count 296
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 709 place count 80 transition count 287
Iterating global reduction 7 with 2 rules applied. Total rules applied 711 place count 80 transition count 287
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 722 place count 80 transition count 276
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 723 place count 80 transition count 276
Applied a total of 723 rules in 119 ms. Remains 80 /589 variables (removed 509) and now considering 276/881 (removed 605) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 80/589 places, 276/881 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1576963 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1576963 steps, saw 194490 distinct states, run finished after 3002 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:22:28] [INFO ] Flow matrix only has 203 transitions (discarded 73 similar events)
// Phase 1: matrix 203 rows 80 cols
[2024-05-21 03:22:28] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 03:22:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 03:22:28] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:28] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:22:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:22:28] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:28] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 03:22:28] [INFO ] After 38ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:28] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-21 03:22:28] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 276/276 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 80/80 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-05-21 03:22:28] [INFO ] Flow matrix only has 203 transitions (discarded 73 similar events)
[2024-05-21 03:22:28] [INFO ] Invariant cache hit.
[2024-05-21 03:22:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 03:22:28] [INFO ] Flow matrix only has 203 transitions (discarded 73 similar events)
[2024-05-21 03:22:28] [INFO ] Invariant cache hit.
[2024-05-21 03:22:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-21 03:22:28] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 03:22:28] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-21 03:22:28] [INFO ] Flow matrix only has 203 transitions (discarded 73 similar events)
[2024-05-21 03:22:28] [INFO ] Invariant cache hit.
[2024-05-21 03:22:29] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 80/80 places, 276/276 transitions.
Graph (trivial) has 48 edges and 80 vertex of which 8 / 80 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 11 transitions
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 84 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 71 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 71 transition count 187
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 67 transition count 187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 63 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 63 transition count 181
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 60 transition count 219
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 68 place count 60 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 58 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 58 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 57 transition count 170
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 57 transition count 170
Applied a total of 80 rules in 31 ms. Remains 57 /80 variables (removed 23) and now considering 170/276 (removed 106) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 170 rows 57 cols
[2024-05-21 03:22:29] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 03:22:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:22:29] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:29] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:22:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:22:29] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 03:22:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:22:29] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:29] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-21 03:22:29] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA CloudDeployment-PT-3b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 91 stabilizing places and 267 stable transitions
Graph (complete) has 1513 edges and 589 vertex of which 570 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.10 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(F(p0)))))'
Support contains 1 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 561 transition count 796
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 560 transition count 794
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Applied a total of 59 rules in 37 ms. Remains 560 /589 variables (removed 29) and now considering 794/881 (removed 87) transitions.
// Phase 1: matrix 794 rows 560 cols
[2024-05-21 03:22:29] [INFO ] Computed 9 invariants in 9 ms
[2024-05-21 03:22:29] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 03:22:29] [INFO ] Invariant cache hit.
[2024-05-21 03:22:30] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [9, 17, 185, 193, 358, 366]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 520 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 554/589 places, 794/881 transitions.
Applied a total of 0 rules in 10 ms. Remains 554 /554 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 554/589 places, 794/881 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 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 6 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-01 finished in 898 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(p0)&&X(p1)))'
Support contains 12 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 573 transition count 865
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 573 transition count 865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 573 transition count 864
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 568 transition count 859
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 568 transition count 859
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 568 transition count 858
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 567 transition count 857
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 567 transition count 857
Applied a total of 46 rules in 46 ms. Remains 567 /589 variables (removed 22) and now considering 857/881 (removed 24) transitions.
// Phase 1: matrix 857 rows 567 cols
[2024-05-21 03:22:30] [INFO ] Computed 10 invariants in 9 ms
[2024-05-21 03:22:30] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 03:22:30] [INFO ] Invariant cache hit.
[2024-05-21 03:22:31] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-21 03:22:31] [INFO ] Invariant cache hit.
[2024-05-21 03:22:31] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 567/589 places, 857/881 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 567/589 places, 857/881 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s485 1), p1:(AND (EQ s11 1) (EQ s18 1) (EQ s40 1) (EQ s185 1) (EQ s196 1) (EQ s216 1) (EQ s362 1) (EQ s371 1) (EQ s391 1) (EQ s533 1) (EQ s564 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-02 finished in 1046 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' '!((!p0 U (G(!p0)||(!p0&&G(p1)&&(F(p2)||G(p3))))))'
Support contains 9 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 594 edges and 589 vertex of which 207 / 589 are part of one of the 23 SCC in 3 ms
Free SCC test removed 184 places
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 1272 edges and 405 vertex of which 386 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.5 ms
Discarding 19 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 386 transition count 449
Reduce places removed 157 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 160 rules applied. Total rules applied 319 place count 229 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 321 place count 227 transition count 446
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 321 place count 227 transition count 418
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 377 place count 199 transition count 418
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 383 place count 193 transition count 412
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 193 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 193 transition count 411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 390 place count 193 transition count 407
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 398 place count 189 transition count 407
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 518 place count 129 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 519 place count 129 transition count 346
Performed 19 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 557 place count 110 transition count 416
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 577 place count 110 transition count 396
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 6 with 35 rules applied. Total rules applied 612 place count 110 transition count 361
Applied a total of 612 rules in 76 ms. Remains 110 /589 variables (removed 479) and now considering 361/881 (removed 520) transitions.
[2024-05-21 03:22:31] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
// Phase 1: matrix 288 rows 110 cols
[2024-05-21 03:22:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 03:22:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 03:22:31] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
[2024-05-21 03:22:31] [INFO ] Invariant cache hit.
[2024-05-21 03:22:31] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-21 03:22:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 03:22:32] [INFO ] Redundant transitions in 229 ms returned []
[2024-05-21 03:22:32] [INFO ] Flow matrix only has 288 transitions (discarded 73 similar events)
[2024-05-21 03:22:32] [INFO ] Invariant cache hit.
[2024-05-21 03:22:32] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/589 places, 361/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 632 ms. Remains : 110/589 places, 361/881 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, (AND p0 (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND p1 p2), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=7 dest: 7}]], initial=4, aps=[p1:(EQ s57 1), p0:(AND (EQ s7 1) (EQ s37 1)), p2:(NEQ s86 1), p3:(AND (EQ s4 1) (EQ s11 1) (EQ s23 1) (EQ s101 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 79 steps with 4 reset in 5 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-04 finished in 1008 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((X(G(p0))||(X(G(p1))&&(p2 U p3)))))'
Support contains 5 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 567 transition count 803
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 567 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 567 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 562 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 562 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 562 transition count 796
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 561 transition count 795
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Applied a total of 57 rules in 44 ms. Remains 561 /589 variables (removed 28) and now considering 795/881 (removed 86) transitions.
// Phase 1: matrix 795 rows 561 cols
[2024-05-21 03:22:32] [INFO ] Computed 9 invariants in 9 ms
[2024-05-21 03:22:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 03:22:32] [INFO ] Invariant cache hit.
[2024-05-21 03:22:33] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [9, 17, 183, 193, 359, 367]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 514 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 555/589 places, 795/881 transitions.
Applied a total of 0 rules in 8 ms. Remains 555 /555 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 555/589 places, 795/881 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s182 1), p2:(AND (EQ s17 1) (EQ s363 1)), p0:(EQ s476 1), p1:(EQ s229 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-05 finished in 862 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((p0||G(!p0))) U X(G(p1))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 568 transition count 804
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 568 transition count 804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 568 transition count 803
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 563 transition count 798
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 563 transition count 798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 562 transition count 797
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 562 transition count 797
Applied a total of 54 rules in 48 ms. Remains 562 /589 variables (removed 27) and now considering 797/881 (removed 84) transitions.
// Phase 1: matrix 797 rows 562 cols
[2024-05-21 03:22:33] [INFO ] Computed 9 invariants in 10 ms
[2024-05-21 03:22:33] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 03:22:33] [INFO ] Invariant cache hit.
[2024-05-21 03:22:34] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [9, 17, 183, 191, 357, 367]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 494 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 556/589 places, 797/881 transitions.
Applied a total of 0 rules in 11 ms. Remains 556 /556 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 556/589 places, 797/881 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) p0), false, (NOT p1), true, (AND p0 p1), (NOT p1), false]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(EQ s356 1), p1:(AND (EQ s368 1) (EQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25040 reset in 378 ms.
Product exploration explored 100000 steps with 24989 reset in 357 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1404 edges and 556 vertex of which 551 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1), false]
Incomplete random walk after 10000 steps, including 106 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 797 rows 556 cols
[2024-05-21 03:22:35] [INFO ] Computed 3 invariants in 5 ms
[2024-05-21 03:22:35] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-21 03:22:36] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:22:36] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:36] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 03:22:36] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-21 03:22:36] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 797/797 transitions.
Graph (trivial) has 578 edges and 556 vertex of which 213 / 556 are part of one of the 24 SCC in 2 ms
Free SCC test removed 189 places
Drop transitions removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Graph (complete) has 1074 edges and 367 vertex of which 362 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 362 transition count 390
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 1 with 153 rules applied. Total rules applied 314 place count 209 transition count 390
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 314 place count 209 transition count 357
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 380 place count 176 transition count 357
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 383 place count 173 transition count 354
Iterating global reduction 2 with 3 rules applied. Total rules applied 386 place count 173 transition count 354
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 386 place count 173 transition count 351
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 392 place count 170 transition count 351
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 490 place count 121 transition count 302
Performed 20 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 530 place count 101 transition count 373
Drop transitions removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 550 place count 101 transition count 353
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 3 with 56 rules applied. Total rules applied 606 place count 101 transition count 297
Free-agglomeration rule applied 31 times with reduction of 5 identical transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 637 place count 101 transition count 261
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 406 edges and 70 vertex of which 69 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 82 rules applied. Total rules applied 719 place count 69 transition count 211
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 720 place count 69 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 723 place count 66 transition count 198
Iterating global reduction 5 with 3 rules applied. Total rules applied 726 place count 66 transition count 198
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 753 place count 66 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 65 transition count 170
Applied a total of 754 rules in 58 ms. Remains 65 /556 variables (removed 491) and now considering 170/797 (removed 627) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 65/556 places, 170/797 transitions.
Finished random walk after 3412 steps, including 1 resets, run visited all 3 properties in 34 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 13 factoid took 322 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-07 finished in 3528 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(p0)&&X(X(G(p1)))))'
Support contains 2 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 560 transition count 795
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 560 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 559 transition count 793
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Applied a total of 61 rules in 47 ms. Remains 559 /589 variables (removed 30) and now considering 793/881 (removed 88) transitions.
// Phase 1: matrix 793 rows 559 cols
[2024-05-21 03:22:37] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 03:22:37] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 03:22:37] [INFO ] Invariant cache hit.
[2024-05-21 03:22:37] [INFO ] Implicit Places using invariants and state equation in 383 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 502 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/589 places, 793/881 transitions.
Applied a total of 0 rules in 10 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 561 ms. Remains : 553/589 places, 793/881 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s495 1), p1:(EQ s506 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 215 steps with 1 reset in 2 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-08 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||G(p2))))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 567 transition count 803
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 567 transition count 803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 567 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 562 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 562 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 562 transition count 796
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 561 transition count 795
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 561 transition count 795
Applied a total of 57 rules in 52 ms. Remains 561 /589 variables (removed 28) and now considering 795/881 (removed 86) transitions.
// Phase 1: matrix 795 rows 561 cols
[2024-05-21 03:22:37] [INFO ] Computed 9 invariants in 8 ms
[2024-05-21 03:22:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 03:22:38] [INFO ] Invariant cache hit.
[2024-05-21 03:22:38] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 502 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 555/589 places, 795/881 transitions.
Applied a total of 0 rules in 14 ms. Remains 555 /555 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 555/589 places, 795/881 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s417 1), p2:(EQ s66 1), p0:(EQ s517 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 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-09 finished in 818 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((X(p0)||G((p1||(p2 U p0))))))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 560 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 560 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 560 transition count 795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 559 transition count 794
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 559 transition count 794
Applied a total of 60 rules in 40 ms. Remains 559 /589 variables (removed 30) and now considering 794/881 (removed 87) transitions.
// Phase 1: matrix 794 rows 559 cols
[2024-05-21 03:22:38] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 03:22:38] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 03:22:38] [INFO ] Invariant cache hit.
[2024-05-21 03:22:39] [INFO ] Implicit Places using invariants and state equation in 397 ms returned [9, 17, 183, 191, 356, 365]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 522 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/589 places, 794/881 transitions.
Applied a total of 0 rules in 11 ms. Remains 553 /553 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 553/589 places, 794/881 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s445 0), p0:(EQ s353 1), p2:(EQ s432 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33312 reset in 378 ms.
Product exploration explored 100000 steps with 33324 reset in 371 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1399 edges and 553 vertex of which 548 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 103 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 794 rows 553 cols
[2024-05-21 03:22:40] [INFO ] Computed 3 invariants in 3 ms
[2024-05-21 03:22:40] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:22:40] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:41] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 03:22:41] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-21 03:22:41] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 122 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=122 )
Parikh walk visited 2 properties in 3 ms.
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 794/794 transitions.
Graph (trivial) has 576 edges and 553 vertex of which 202 / 553 are part of one of the 24 SCC in 1 ms
Free SCC test removed 178 places
Drop transitions removed 233 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 1085 edges and 375 vertex of which 370 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 370 transition count 398
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 320 place count 214 transition count 398
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 320 place count 214 transition count 362
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 392 place count 178 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 395 place count 175 transition count 359
Iterating global reduction 2 with 3 rules applied. Total rules applied 398 place count 175 transition count 359
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 398 place count 175 transition count 356
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 404 place count 172 transition count 356
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 502 place count 123 transition count 307
Performed 24 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 550 place count 99 transition count 405
Drop transitions removed 10 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 581 place count 99 transition count 374
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 659 place count 99 transition count 296
Free-agglomeration rule applied 29 times with reduction of 5 identical transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 688 place count 99 transition count 262
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 416 edges and 70 vertex of which 69 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 76 rules applied. Total rules applied 764 place count 69 transition count 216
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 765 place count 69 transition count 215
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 767 place count 67 transition count 207
Iterating global reduction 5 with 2 rules applied. Total rules applied 769 place count 67 transition count 207
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 796 place count 67 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 797 place count 67 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 798 place count 66 transition count 179
Applied a total of 798 rules in 43 ms. Remains 66 /553 variables (removed 487) and now considering 179/794 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 66/553 places, 179/794 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 270 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=270 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (NOT (OR p2 p0 p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p0 p1)))
Knowledge based reduction with 8 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-10 finished in 3025 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))&&(!p0 U !p1)))'
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 603 edges and 589 vertex of which 211 / 589 are part of one of the 23 SCC in 1 ms
Free SCC test removed 188 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Graph (complete) has 1267 edges and 401 vertex of which 382 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 381 transition count 440
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 323 place count 221 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 220 transition count 439
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 324 place count 220 transition count 411
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 380 place count 192 transition count 411
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 385 place count 187 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 390 place count 187 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 187 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 391 place count 187 transition count 402
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 397 place count 184 transition count 402
Performed 61 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 519 place count 123 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 520 place count 123 transition count 339
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 556 place count 105 transition count 408
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 574 place count 105 transition count 390
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 610 place count 105 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 611 place count 104 transition count 353
Applied a total of 611 rules in 80 ms. Remains 104 /589 variables (removed 485) and now considering 353/881 (removed 528) transitions.
[2024-05-21 03:22:41] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
// Phase 1: matrix 277 rows 104 cols
[2024-05-21 03:22:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 03:22:42] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 03:22:42] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
[2024-05-21 03:22:42] [INFO ] Invariant cache hit.
[2024-05-21 03:22:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:22:42] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-21 03:22:42] [INFO ] Redundant transitions in 195 ms returned []
[2024-05-21 03:22:42] [INFO ] Flow matrix only has 277 transitions (discarded 76 similar events)
[2024-05-21 03:22:42] [INFO ] Invariant cache hit.
[2024-05-21 03:22:42] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/589 places, 353/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 104/589 places, 353/881 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p1), true, (NOT p0), p1]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s46 1), p1:(AND (EQ s37 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-11 finished in 1068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 565 transition count 801
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 565 transition count 801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 565 transition count 800
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 559 transition count 794
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 559 transition count 794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 558 transition count 792
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 558 transition count 792
Applied a total of 63 rules in 42 ms. Remains 558 /589 variables (removed 31) and now considering 792/881 (removed 89) transitions.
// Phase 1: matrix 792 rows 558 cols
[2024-05-21 03:22:42] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 03:22:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 03:22:42] [INFO ] Invariant cache hit.
[2024-05-21 03:22:43] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 518 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 552/589 places, 792/881 transitions.
Applied a total of 0 rules in 15 ms. Remains 552 /552 variables (removed 0) and now considering 792/792 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 552/589 places, 792/881 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s355 1) (EQ s371 1) (EQ s491 1) (EQ s537 1) (EQ s548 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-12 finished in 706 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)&&F(G(p1)))))'
Support contains 6 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Graph (trivial) has 596 edges and 589 vertex of which 207 / 589 are part of one of the 22 SCC in 0 ms
Free SCC test removed 185 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Graph (complete) has 1270 edges and 404 vertex of which 386 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions removed 65 transitions
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 386 transition count 445
Reduce places removed 160 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 226 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 224 transition count 443
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 326 place count 224 transition count 415
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 382 place count 196 transition count 415
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 191 transition count 410
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 191 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 191 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 393 place count 191 transition count 406
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 399 place count 188 transition count 406
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 523 place count 126 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 524 place count 126 transition count 342
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 560 place count 108 transition count 411
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 578 place count 108 transition count 393
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 614 place count 108 transition count 357
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 617 place count 108 transition count 357
Applied a total of 617 rules in 57 ms. Remains 108 /589 variables (removed 481) and now considering 357/881 (removed 524) transitions.
[2024-05-21 03:22:43] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
// Phase 1: matrix 285 rows 108 cols
[2024-05-21 03:22:43] [INFO ] Computed 3 invariants in 5 ms
[2024-05-21 03:22:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 03:22:43] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
[2024-05-21 03:22:43] [INFO ] Invariant cache hit.
[2024-05-21 03:22:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 03:22:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 03:22:43] [INFO ] Redundant transitions in 176 ms returned []
[2024-05-21 03:22:43] [INFO ] Flow matrix only has 285 transitions (discarded 72 similar events)
[2024-05-21 03:22:43] [INFO ] Invariant cache hit.
[2024-05-21 03:22:44] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/589 places, 357/881 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 108/589 places, 357/881 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s13 0), p1:(AND (EQ s34 1) (EQ s40 1) (EQ s53 1) (EQ s99 1) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-13 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(F(!p0))||(!p1&&F(!p0)))))||(F(G(p2))&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 881/881 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 881
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 566 transition count 802
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 566 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 566 transition count 801
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 560 transition count 795
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 560 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 560 transition count 794
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 559 transition count 793
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 559 transition count 793
Applied a total of 61 rules in 34 ms. Remains 559 /589 variables (removed 30) and now considering 793/881 (removed 88) transitions.
// Phase 1: matrix 793 rows 559 cols
[2024-05-21 03:22:44] [INFO ] Computed 9 invariants in 8 ms
[2024-05-21 03:22:44] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 03:22:44] [INFO ] Invariant cache hit.
[2024-05-21 03:22:44] [INFO ] Implicit Places using invariants and state equation in 374 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 498 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/589 places, 793/881 transitions.
Applied a total of 0 rules in 11 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 553/589 places, 793/881 transitions.
Stuttering acceptance computed with spot in 266 ms :[p0, p0, (AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s382 1) (AND (EQ s10 1) (EQ s106 1))), p0:(AND (EQ s10 1) (EQ s106 1)), p2:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1058 reset in 182 ms.
Product exploration explored 100000 steps with 1049 reset in 210 ms.
Computed a total of 81 stabilizing places and 201 stable transitions
Graph (complete) has 1400 edges and 553 vertex of which 548 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 104 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 793 rows 553 cols
[2024-05-21 03:22:45] [INFO ] Computed 3 invariants in 8 ms
[2024-05-21 03:22:45] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:45] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:22:46] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:22:46] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:22:46] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-21 03:22:46] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 132 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND p2 p0))]
Knowledge based reduction with 7 factoid took 384 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 3 out of 553 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 793/793 transitions.
Graph (trivial) has 573 edges and 553 vertex of which 209 / 553 are part of one of the 23 SCC in 1 ms
Free SCC test removed 186 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 1148 edges and 367 vertex of which 362 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 361 transition count 429
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 298 place count 213 transition count 429
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 298 place count 213 transition count 397
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 362 place count 181 transition count 397
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 474 place count 125 transition count 341
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 510 place count 107 transition count 410
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 528 place count 107 transition count 392
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 3 with 45 rules applied. Total rules applied 573 place count 107 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 106 transition count 346
Applied a total of 574 rules in 40 ms. Remains 106 /553 variables (removed 447) and now considering 346/793 (removed 447) transitions.
[2024-05-21 03:22:46] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
// Phase 1: matrix 273 rows 106 cols
[2024-05-21 03:22:46] [INFO ] Computed 3 invariants in 7 ms
[2024-05-21 03:22:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 03:22:47] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-05-21 03:22:47] [INFO ] Invariant cache hit.
[2024-05-21 03:22:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:22:47] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 03:22:47] [INFO ] Redundant transitions in 182 ms returned []
[2024-05-21 03:22:47] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2024-05-21 03:22:47] [INFO ] Invariant cache hit.
[2024-05-21 03:22:47] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/553 places, 346/793 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 106/553 places, 346/793 transitions.
Computed a total of 30 stabilizing places and 201 stable transitions
Computed a total of 30 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 299049 steps, run visited all 2 properties in 659 ms. (steps per millisecond=453 )
Probabilistic random walk after 299049 steps, saw 46916 distinct states, run finished after 660 ms. (steps per millisecond=453 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 5843 reset in 244 ms.
Product exploration explored 100000 steps with 5825 reset in 236 ms.
Built C files in :
/tmp/ltsmin3634303065651211630
[2024-05-21 03:22:49] [INFO ] Computing symmetric may disable matrix : 346 transitions.
[2024-05-21 03:22:49] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:22:49] [INFO ] Computing symmetric may enable matrix : 346 transitions.
[2024-05-21 03:22:49] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:22:49] [INFO ] Computing Do-Not-Accords matrix : 346 transitions.
[2024-05-21 03:22:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:22:49] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3634303065651211630
Running compilation step : cd /tmp/ltsmin3634303065651211630;'/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 840 ms.
Running link step : cd /tmp/ltsmin3634303065651211630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3634303065651211630;'/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/stateBased4590629151500405241.hoa' '--buchi-type=spotba'
LTSmin run took 2944 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-3b-LTLFireability-14 finished in 9012 ms.
All properties solved by simple procedures.
Total runtime 34813 ms.

BK_STOP 1716261774083

--------------------
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-3b"
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-3b, 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-171620522000353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3b.tgz
mv CloudDeployment-PT-3b 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 ;