About the Execution of ITS-Tools for CloudDeployment-PT-4a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
306.411 | 29610.00 | 57534.00 | 407.30 | FFTTFTFTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095100035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudDeployment-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095100035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 6.7K Apr 30 11:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 11:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 11:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 11:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-4a-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-4a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652544632576
Running Version 202205111006
[2022-05-14 16:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 16:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 16:10:35] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2022-05-14 16:10:35] [INFO ] Transformed 141 places.
[2022-05-14 16:10:35] [INFO ] Transformed 475 transitions.
[2022-05-14 16:10:35] [INFO ] Found NUPN structural information;
[2022-05-14 16:10:35] [INFO ] Parsed PT model containing 141 places and 475 transitions in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
FORMULA CloudDeployment-PT-4a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 423/423 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 133 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 132 transition count 422
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 132 transition count 422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 131 transition count 421
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 131 transition count 421
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 50 place count 131 transition count 383
Applied a total of 50 rules in 86 ms. Remains 131 /141 variables (removed 10) and now considering 383/423 (removed 40) transitions.
[2022-05-14 16:10:36] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2022-05-14 16:10:36] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-14 16:10:36] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-05-14 16:10:36] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2022-05-14 16:10:36] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-14 16:10:36] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-05-14 16:10:36] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2022-05-14 16:10:36] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2022-05-14 16:10:36] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-14 16:10:37] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/141 places, 383/423 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/141 places, 383/423 transitions.
Support contains 26 out of 131 places after structural reductions.
[2022-05-14 16:10:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-14 16:10:37] [INFO ] Flatten gal took : 143 ms
FORMULA CloudDeployment-PT-4a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 16:10:37] [INFO ] Flatten gal took : 78 ms
[2022-05-14 16:10:37] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-14 16:10:39] [INFO ] Flow matrix only has 224 transitions (discarded 159 similar events)
// Phase 1: matrix 224 rows 131 cols
[2022-05-14 16:10:39] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-14 16:10:39] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-14 16:10:39] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2022-05-14 16:10:39] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-14 16:10:39] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-05-14 16:10:39] [INFO ] After 44ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-14 16:10:39] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-14 16:10:39] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 161 edges and 131 vertex of which 40 / 131 are part of one of the 12 SCC in 5 ms
Free SCC test removed 28 places
Drop transitions removed 88 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 108 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 98 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 98 transition count 254
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 35 place count 86 transition count 282
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 91 place count 86 transition count 226
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 86 transition count 237
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 99 place count 82 transition count 237
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 82 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 81 transition count 236
Applied a total of 101 rules in 109 ms. Remains 81 /131 variables (removed 50) and now considering 236/383 (removed 147) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/131 places, 236/383 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 302791 steps, run visited all 1 properties in 819 ms. (steps per millisecond=369 )
Probabilistic random walk after 302791 steps, saw 55703 distinct states, run finished after 819 ms. (steps per millisecond=369 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA CloudDeployment-PT-4a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 63 stabilizing places and 247 stable transitions
Graph (complete) has 1094 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(G(F(p0))))&&(G(F(p2))||p1))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 150 edges and 131 vertex of which 39 / 131 are part of one of the 12 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 99 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 99 transition count 288
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 33 place count 88 transition count 310
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 0 with 47 rules applied. Total rules applied 80 place count 88 transition count 263
Applied a total of 80 rules in 56 ms. Remains 88 /131 variables (removed 43) and now considering 263/383 (removed 120) transitions.
[2022-05-14 16:10:41] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
// Phase 1: matrix 120 rows 88 cols
[2022-05-14 16:10:41] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-14 16:10:41] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
// Phase 1: matrix 120 rows 88 cols
[2022-05-14 16:10:41] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-14 16:10:41] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-14 16:10:41] [INFO ] Redundant transitions in 388 ms returned []
[2022-05-14 16:10:41] [INFO ] Flow matrix only has 120 transitions (discarded 143 similar events)
// Phase 1: matrix 120 rows 88 cols
[2022-05-14 16:10:41] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:42] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/131 places, 263/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/131 places, 263/383 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s30 1)), p1:(OR (EQ s28 0) (EQ s30 1)), p2:(AND (EQ s56 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-00 finished in 1475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 382
Applied a total of 2 rules in 12 ms. Remains 130 /131 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2022-05-14 16:10:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:42] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-14 16:10:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:42] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-14 16:10:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:42] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-05-14 16:10:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:42] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-14 16:10:43] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/131 places, 382/383 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-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: 1}]], initial=2, aps=[p0:(AND (EQ s107 0) (EQ s70 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][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X(p0))))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 155 edges and 131 vertex of which 40 / 131 are part of one of the 12 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 97 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 97 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 29 place count 88 transition count 311
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 78 place count 88 transition count 262
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 88 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 87 transition count 261
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 87 transition count 261
Applied a total of 82 rules in 54 ms. Remains 87 /131 variables (removed 44) and now considering 261/383 (removed 122) transitions.
[2022-05-14 16:10:43] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:43] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-14 16:10:43] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:43] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-14 16:10:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-14 16:10:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-14 16:10:43] [INFO ] Redundant transitions in 259 ms returned []
[2022-05-14 16:10:43] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:43] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:44] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/131 places, 261/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/131 places, 261/383 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Computed a total of 51 stabilizing places and 189 stable transitions
Graph (complete) has 855 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 189 stable transitions
Detected a total of 51/87 stabilizing places and 189/261 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 258 steps, including 7 resets, run visited all 1 properties in 4 ms. (steps per millisecond=64 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 87 /87 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2022-05-14 16:10:45] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:45] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-14 16:10:45] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:45] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-14 16:10:45] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-05-14 16:10:45] [INFO ] Redundant transitions in 305 ms returned []
[2022-05-14 16:10:45] [INFO ] Flow matrix only has 118 transitions (discarded 143 similar events)
// Phase 1: matrix 118 rows 87 cols
[2022-05-14 16:10:45] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-14 16:10:45] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 261/261 transitions.
Computed a total of 51 stabilizing places and 189 stable transitions
Graph (complete) has 855 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 189 stable transitions
Detected a total of 51/87 stabilizing places and 189/261 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 268 ms.
Built C files in :
/tmp/ltsmin8961056423242835816
[2022-05-14 16:10:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2022-05-14 16:10:47] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:10:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2022-05-14 16:10:47] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:10:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2022-05-14 16:10:47] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-14 16:10:47] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8961056423242835816
Running compilation step : cd /tmp/ltsmin8961056423242835816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1203 ms.
Running link step : cd /tmp/ltsmin8961056423242835816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin8961056423242835816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7729012927823408298.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-4a-LTLCardinality-06 finished in 5441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 382
Applied a total of 2 rules in 6 ms. Remains 130 /131 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2022-05-14 16:10:48] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:48] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2022-05-14 16:10:48] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:48] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:48] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:49] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2022-05-14 16:10:49] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:49] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:49] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/131 places, 382/383 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s124 0) (EQ s120 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-08 finished in 1018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1)&&(p2 U !p3))))'
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 382
Applied a total of 2 rules in 4 ms. Remains 130 /131 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2022-05-14 16:10:49] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:49] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:49] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-14 16:10:49] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:49] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-14 16:10:49] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:50] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2022-05-14 16:10:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:50] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-14 16:10:50] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/131 places, 382/383 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), true, (NOT p0), (NOT p1), p3, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p0 (NOT p3)) (AND p0 p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 p3 p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s77 1)), p3:(OR (NOT (OR (EQ s77 0) (EQ s10 1))) (EQ s10 0) (EQ s8 1)), p2:(OR (EQ s84 0) (EQ s108 1)), p1:(AND (EQ s8 0) (EQ s10 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-09 finished in 984 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 382
Applied a total of 2 rules in 5 ms. Remains 130 /131 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2022-05-14 16:10:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:50] [INFO ] Computed 16 place invariants in 6 ms
[2022-05-14 16:10:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-14 16:10:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:50] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-14 16:10:50] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:51] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-05-14 16:10:51] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:51] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:51] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/131 places, 382/383 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-10 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 s61 0) (EQ s115 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 1 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-10 finished in 860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 158 edges and 131 vertex of which 40 / 131 are part of one of the 12 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 97 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 97 transition count 285
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 33 place count 86 transition count 312
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 87 place count 86 transition count 258
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 86 transition count 258
Applied a total of 88 rules in 41 ms. Remains 86 /131 variables (removed 45) and now considering 258/383 (removed 125) transitions.
[2022-05-14 16:10:51] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:51] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-14 16:10:51] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:51] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-14 16:10:51] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2022-05-14 16:10:52] [INFO ] Redundant transitions in 247 ms returned []
[2022-05-14 16:10:52] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:52] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:52] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/131 places, 258/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/131 places, 258/383 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), true, p0]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-11 finished in 888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 155 edges and 131 vertex of which 36 / 131 are part of one of the 11 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 100 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 100 transition count 292
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 35 place count 88 transition count 320
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 92 place count 88 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 87 transition count 262
Applied a total of 94 rules in 35 ms. Remains 87 /131 variables (removed 44) and now considering 262/383 (removed 121) transitions.
[2022-05-14 16:10:52] [INFO ] Flow matrix only has 119 transitions (discarded 143 similar events)
// Phase 1: matrix 119 rows 87 cols
[2022-05-14 16:10:52] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-05-14 16:10:52] [INFO ] Flow matrix only has 119 transitions (discarded 143 similar events)
// Phase 1: matrix 119 rows 87 cols
[2022-05-14 16:10:52] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-14 16:10:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-14 16:10:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-05-14 16:10:52] [INFO ] Redundant transitions in 210 ms returned []
[2022-05-14 16:10:52] [INFO ] Flow matrix only has 119 transitions (discarded 143 similar events)
// Phase 1: matrix 119 rows 87 cols
[2022-05-14 16:10:52] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-14 16:10:53] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/131 places, 262/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/131 places, 262/383 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-12 finished in 727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((X(G(p0))&&G(p1)))))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Graph (trivial) has 161 edges and 131 vertex of which 40 / 131 are part of one of the 12 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 98 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 98 transition count 286
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 33 place count 86 transition count 314
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 89 place count 86 transition count 258
Applied a total of 89 rules in 31 ms. Remains 86 /131 variables (removed 45) and now considering 258/383 (removed 125) transitions.
[2022-05-14 16:10:53] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:53] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-05-14 16:10:53] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:53] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-14 16:10:53] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-05-14 16:10:53] [INFO ] Redundant transitions in 218 ms returned []
[2022-05-14 16:10:53] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-14 16:10:53] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:53] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/131 places, 258/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/131 places, 258/383 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s65 0), p0:(EQ s45 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-13 finished in 962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 382
Applied a total of 2 rules in 3 ms. Remains 130 /131 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2022-05-14 16:10:54] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:54] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2022-05-14 16:10:54] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:54] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:54] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:54] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2022-05-14 16:10:54] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:54] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-14 16:10:54] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 382/383 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/131 places, 382/383 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s31 0), p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Computed a total of 62 stabilizing places and 246 stable transitions
Graph (complete) has 1092 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 62 stabilizing places and 246 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 580 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 163 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 16:10:56] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:56] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 11 factoid took 855 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 382/382 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2022-05-14 16:10:57] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:57] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:10:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-14 16:10:57] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:57] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:57] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-05-14 16:10:58] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-14 16:10:58] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2022-05-14 16:10:58] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-14 16:10:58] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 382/382 transitions.
Computed a total of 62 stabilizing places and 246 stable transitions
Graph (complete) has 1092 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 62 stabilizing places and 246 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 437 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 209 steps, including 3 resets, run visited all 2 properties in 6 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 408 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 414 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 382/382 transitions.
Graph (trivial) has 157 edges and 130 vertex of which 38 / 130 are part of one of the 11 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 100 transition count 293
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 100 transition count 293
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 100 transition count 349
Deduced a syphon composed of 12 places in 0 ms
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 0 with 68 rules applied. Total rules applied 87 place count 100 transition count 281
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 87 rules in 51 ms. Remains 100 /130 variables (removed 30) and now considering 281/382 (removed 101) transitions.
[2022-05-14 16:11:01] [INFO ] Redundant transitions in 455 ms returned []
[2022-05-14 16:11:01] [INFO ] Flow matrix only has 134 transitions (discarded 147 similar events)
// Phase 1: matrix 134 rows 100 cols
[2022-05-14 16:11:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-14 16:11:01] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/130 places, 281/382 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/130 places, 281/382 transitions.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-15 finished in 7903 ms.
All properties solved by simple procedures.
Total runtime 27089 ms.
BK_STOP 1652544662186
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-4a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-4a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095100035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;