Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399500395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CloudDeployment-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399500395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1678464747701

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 16:12:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:12:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:12:30] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-10 16:12:30] [INFO ] Transformed 141 places.
[2023-03-10 16:12:30] [INFO ] Transformed 475 transitions.
[2023-03-10 16:12:30] [INFO ] Found NUPN structural information;
[2023-03-10 16:12:30] [INFO ] Parsed PT model containing 141 places and 475 transitions and 2657 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
FORMULA CloudDeployment-PT-4a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 48 place count 132 transition count 384
Applied a total of 48 rules in 56 ms. Remains 132 /141 variables (removed 9) and now considering 384/423 (removed 39) transitions.
[2023-03-10 16:12:31] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-10 16:12:31] [INFO ] Computed 16 place invariants in 15 ms
[2023-03-10 16:12:31] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-10 16:12:31] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 16:12:31] [INFO ] Invariant cache hit.
[2023-03-10 16:12:31] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-10 16:12:31] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-10 16:12:31] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 16:12:31] [INFO ] Invariant cache hit.
[2023-03-10 16:12:32] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/141 places, 384/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 132/141 places, 384/423 transitions.
Support contains 23 out of 132 places after structural reductions.
[2023-03-10 16:12:32] [INFO ] Flatten gal took : 94 ms
[2023-03-10 16:12:32] [INFO ] Flatten gal took : 43 ms
[2023-03-10 16:12:32] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 21 out of 132 places (down from 23) after GAL structural reductions.
Finished random walk after 1089 steps, including 18 resets, run visited all 14 properties in 100 ms. (steps per millisecond=10 )
FORMULA CloudDeployment-PT-4a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 64 stabilizing places and 248 stable transitions
Graph (complete) has 1097 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p0||X(p1))))))))'
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 130 transition count 382
Applied a total of 4 rules in 16 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-10 16:12:32] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 16:12:32] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 16:12:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 16:12:33] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:33] [INFO ] Invariant cache hit.
[2023-03-10 16:12:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:33] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 16:12:33] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:33] [INFO ] Invariant cache hit.
[2023-03-10 16:12:33] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/132 places, 382/384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s77 0), p1:(OR (EQ s84 0) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 29299 reset in 1126 ms.
Product exploration explored 100000 steps with 29317 reset in 1000 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.6 ms
Computed a total of 62 stabilizing places and 246 stable transitions
Detected a total of 62/130 stabilizing places and 246/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :1
Finished Best-First random walk after 2714 steps, including 7 resets, run visited all 1 properties in 9 ms. (steps per millisecond=301 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 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 5 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-10 16:12:37] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-10 16:12:37] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:37] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-10 16:12:37] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:37] [INFO ] Invariant cache hit.
[2023-03-10 16:12:37] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. 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
Detected a total of 62/130 stabilizing places and 246/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 175 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Finished Best-First random walk after 3649 steps, including 8 resets, run visited all 1 properties in 9 ms. (steps per millisecond=405 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 29337 reset in 937 ms.
Product exploration explored 100000 steps with 29461 reset in 950 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 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 40 / 130 are part of one of the 12 SCC in 6 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 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 11 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 20 place count 98 transition count 334
Deduced a syphon composed of 11 places in 1 ms
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 80 place count 98 transition count 274
Deduced a syphon composed of 11 places in 1 ms
Applied a total of 80 rules in 80 ms. Remains 98 /130 variables (removed 32) and now considering 274/382 (removed 108) transitions.
[2023-03-10 16:12:41] [INFO ] Redundant transitions in 238 ms returned []
[2023-03-10 16:12:41] [INFO ] Flow matrix only has 131 transitions (discarded 143 similar events)
// Phase 1: matrix 131 rows 98 cols
[2023-03-10 16:12:41] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 16:12:41] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/130 places, 274/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 98/130 places, 274/382 transitions.
Support contains 3 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 4 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-10 16:12:41] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 16:12:41] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 16:12:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 16:12:41] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:41] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-10 16:12:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 130/130 places, 382/382 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 9746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&X(p1)) U p2))))'
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 130 transition count 382
Applied a total of 4 rules in 9 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-10 16:12:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 16:12:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:42] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 16:12:42] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:42] [INFO ] Invariant cache hit.
[2023-03-10 16:12:43] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/132 places, 382/384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s88 0) (EQ s7 1)), p0:(OR (EQ s8 0) (EQ s127 1)), p1:(NEQ s122 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 151 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
Detected a total of 62/130 stabilizing places and 246/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 512 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 173 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:12:44] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:44] [INFO ] Invariant cache hit.
[2023-03-10 16:12:44] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:12:44] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-10 16:12:45] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:12:45] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:45] [INFO ] After 54ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:12:45] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-10 16:12:45] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 382/382 transitions.
Graph (trivial) has 158 edges and 130 vertex of which 38 / 130 are part of one of the 12 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions removed 85 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (complete) has 561 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 102 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 98 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 98 transition count 257
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 94 transition count 253
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 1 with 24 rules applied. Total rules applied 43 place count 82 transition count 281
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 1 with 57 rules applied. Total rules applied 100 place count 82 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 82 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 81 transition count 225
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 81 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 80 transition count 223
Applied a total of 104 rules in 59 ms. Remains 80 /130 variables (removed 50) and now considering 223/382 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 80/130 places, 223/382 transitions.
Finished random walk after 1107 steps, including 23 resets, run visited all 2 properties in 27 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (F (AND p0 p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (F (NOT (OR p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 635 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 5 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.
[2023-03-10 16:12:46] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
[2023-03-10 16:12:46] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 16:12:46] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
[2023-03-10 16:12:46] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:46] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-10 16:12:46] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:46] [INFO ] Invariant cache hit.
[2023-03-10 16:12:47] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. 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.2 ms
Computed a total of 62 stabilizing places and 246 stable transitions
Detected a total of 62/130 stabilizing places and 246/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 510 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 167 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 16:12:48] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:48] [INFO ] Invariant cache hit.
[2023-03-10 16:12:48] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:12:48] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-10 16:12:48] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:12:48] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:48] [INFO ] After 48ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 16:12:48] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 16:12:48] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 382/382 transitions.
Graph (trivial) has 158 edges and 130 vertex of which 38 / 130 are part of one of the 12 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions removed 85 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (complete) has 561 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 102 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 98 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 98 transition count 257
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 94 transition count 253
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 1 with 24 rules applied. Total rules applied 43 place count 82 transition count 281
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 1 with 57 rules applied. Total rules applied 100 place count 82 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 82 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 81 transition count 225
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 81 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 80 transition count 223
Applied a total of 104 rules in 64 ms. Remains 80 /130 variables (removed 50) and now considering 223/382 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 80/130 places, 223/382 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Finished Best-First random walk after 2261 steps, including 10 resets, run visited all 2 properties in 8 ms. (steps per millisecond=282 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1))))), (F (AND p0 p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (F (NOT (OR p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 5 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 158 edges and 130 vertex of which 38 / 130 are part of one of the 12 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 100 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 100 transition count 291
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 21 place count 100 transition count 347
Deduced a syphon composed of 12 places in 0 ms
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 0 with 69 rules applied. Total rules applied 90 place count 100 transition count 278
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 90 rules in 36 ms. Remains 100 /130 variables (removed 30) and now considering 278/382 (removed 104) transitions.
[2023-03-10 16:12:50] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-10 16:12:50] [INFO ] Flow matrix only has 135 transitions (discarded 143 similar events)
// Phase 1: matrix 135 rows 100 cols
[2023-03-10 16:12:50] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 16:12:50] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/130 places, 278/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 100/130 places, 278/382 transitions.
Support contains 5 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 1 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-10 16:12:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 16:12:50] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 16:12:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-10 16:12:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:50] [INFO ] Invariant cache hit.
[2023-03-10 16:12:50] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:50] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-10 16:12:50] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:50] [INFO ] Invariant cache hit.
[2023-03-10 16:12:51] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 130/130 places, 382/382 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 8594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 130 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 130 transition count 382
Applied a total of 4 rules in 7 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-10 16:12:51] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:51] [INFO ] Invariant cache hit.
[2023-03-10 16:12:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 16:12:51] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:51] [INFO ] Invariant cache hit.
[2023-03-10 16:12:51] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 16:12:51] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-10 16:12:51] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 16:12:51] [INFO ] Invariant cache hit.
[2023-03-10 16:12:51] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/132 places, 382/384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-06 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 s15 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-06 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((!p1 U p2))))))'
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Graph (trivial) has 151 edges and 132 vertex of which 34 / 132 are part of one of the 9 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 308
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 23 place count 95 transition count 324
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 64 place count 95 transition count 283
Applied a total of 64 rules in 39 ms. Remains 95 /132 variables (removed 37) and now considering 283/384 (removed 101) transitions.
[2023-03-10 16:12:52] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
// Phase 1: matrix 128 rows 95 cols
[2023-03-10 16:12:52] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:12:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-10 16:12:52] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-10 16:12:52] [INFO ] Invariant cache hit.
[2023-03-10 16:12:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 16:12:52] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-10 16:12:52] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-10 16:12:52] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-10 16:12:52] [INFO ] Invariant cache hit.
[2023-03-10 16:12:52] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/132 places, 283/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 770 ms. Remains : 95/132 places, 283/384 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s36 0) (EQ s49 1)), p2:(OR (EQ s3 0) (EQ s15 1)), p1:(OR (EQ s54 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-08 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((X(X(F(p2)))&&p1)))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-10 16:12:52] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-10 16:12:52] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-10 16:12:53] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-10 16:12:53] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 16:12:53] [INFO ] Invariant cache hit.
[2023-03-10 16:12:53] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-10 16:12:53] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-10 16:12:53] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 16:12:53] [INFO ] Invariant cache hit.
[2023-03-10 16:12:53] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 132/132 places, 384/384 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s117 0) (EQ s109 1)), p2:(AND (EQ s12 0) (EQ s29 1)), p1:(AND (EQ s117 0) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, 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-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-09 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Graph (trivial) has 155 edges and 132 vertex of which 40 / 132 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.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 99 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 99 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 98 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 98 transition count 286
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 35 place count 87 transition count 308
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 84 place count 87 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 86 transition count 258
Applied a total of 86 rules in 35 ms. Remains 86 /132 variables (removed 46) and now considering 258/384 (removed 126) transitions.
[2023-03-10 16:12:53] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2023-03-10 16:12:53] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:12:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 16:12:53] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-10 16:12:53] [INFO ] Invariant cache hit.
[2023-03-10 16:12:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-10 16:12:54] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-10 16:12:54] [INFO ] Redundant transitions in 201 ms returned []
[2023-03-10 16:12:54] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-10 16:12:54] [INFO ] Invariant cache hit.
[2023-03-10 16:12:54] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/132 places, 258/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 86/132 places, 258/384 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s32 0) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 1156 ms.
Product exploration explored 100000 steps with 50000 reset in 1241 ms.
Computed a total of 50 stabilizing places and 186 stable transitions
Graph (complete) has 868 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 50 stabilizing places and 186 stable transitions
Detected a total of 50/86 stabilizing places and 186/258 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4a-LTLCardinality-10 finished in 3273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p0||X(p1))))))))'
Found a Shortening insensitive property : CloudDeployment-PT-4a-LTLCardinality-01
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Graph (trivial) has 157 edges and 132 vertex of which 40 / 132 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 98 transition count 286
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 98 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 97 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 285
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
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 35 place count 86 transition count 307
Applied a total of 35 rules in 19 ms. Remains 86 /132 variables (removed 46) and now considering 307/384 (removed 77) transitions.
[2023-03-10 16:12:57] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
// Phase 1: matrix 164 rows 86 cols
[2023-03-10 16:12:57] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:12:57] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 16:12:57] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:12:57] [INFO ] Invariant cache hit.
[2023-03-10 16:12:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 16:12:57] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-10 16:12:57] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:12:57] [INFO ] Invariant cache hit.
[2023-03-10 16:12:57] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 86/132 places, 307/384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 458 ms. Remains : 86/132 places, 307/384 transitions.
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s44 0), p1:(OR (EQ s50 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28801 reset in 447 ms.
Product exploration explored 100000 steps with 28896 reset in 422 ms.
Computed a total of 50 stabilizing places and 231 stable transitions
Graph (complete) has 902 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 50 stabilizing places and 231 stable transitions
Detected a total of 50/86 stabilizing places and 231/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 303 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Finished Best-First random walk after 2856 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=952 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 307/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-10 16:12:59] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:12:59] [INFO ] Invariant cache hit.
[2023-03-10 16:12:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-10 16:12:59] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:12:59] [INFO ] Invariant cache hit.
[2023-03-10 16:12:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 16:12:59] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-10 16:12:59] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:12:59] [INFO ] Invariant cache hit.
[2023-03-10 16:13:00] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 86/86 places, 307/307 transitions.
Computed a total of 50 stabilizing places and 231 stable transitions
Graph (complete) has 902 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 50 stabilizing places and 231 stable transitions
Detected a total of 50/86 stabilizing places and 231/307 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Finished Best-First random walk after 739 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=369 )
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28792 reset in 364 ms.
Product exploration explored 100000 steps with 28729 reset in 383 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 307/307 transitions.
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 86 transition count 258
Applied a total of 49 rules in 21 ms. Remains 86 /86 variables (removed 0) and now considering 258/307 (removed 49) transitions.
[2023-03-10 16:13:02] [INFO ] Redundant transitions in 196 ms returned []
[2023-03-10 16:13:02] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2023-03-10 16:13:02] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:13:02] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/86 places, 258/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 86/86 places, 258/307 transitions.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 307/307 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-10 16:13:02] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
// Phase 1: matrix 164 rows 86 cols
[2023-03-10 16:13:02] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:13:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 16:13:02] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:13:02] [INFO ] Invariant cache hit.
[2023-03-10 16:13:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 16:13:02] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-10 16:13:02] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-10 16:13:02] [INFO ] Invariant cache hit.
[2023-03-10 16:13:03] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 86/86 places, 307/307 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 6050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&X(p1)) U p2))))'
Found a Lengthening insensitive property : CloudDeployment-PT-4a-LTLCardinality-05
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 384/384 transitions.
Graph (trivial) has 158 edges and 132 vertex of which 38 / 132 are part of one of the 12 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 101 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 101 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 100 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 100 transition count 291
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 37 place count 88 transition count 319
Applied a total of 37 rules in 15 ms. Remains 88 /132 variables (removed 44) and now considering 319/384 (removed 65) transitions.
[2023-03-10 16:13:03] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
// Phase 1: matrix 176 rows 88 cols
[2023-03-10 16:13:03] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:13:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-10 16:13:03] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:03] [INFO ] Invariant cache hit.
[2023-03-10 16:13:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-10 16:13:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-10 16:13:03] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:03] [INFO ] Invariant cache hit.
[2023-03-10 16:13:03] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 88/132 places, 319/384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 473 ms. Remains : 88/132 places, 319/384 transitions.
Running random walk in product with property : CloudDeployment-PT-4a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s54 0) (EQ s6 1)), p0:(OR (EQ s7 0) (EQ s85 1)), p1:(NEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 50 stabilizing places and 239 stable transitions
Graph (complete) has 937 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 50 stabilizing places and 239 stable transitions
Detected a total of 50/88 stabilizing places and 239/319 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 494 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Finished random walk after 647 steps, including 18 resets, run visited all 5 properties in 15 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (F (AND p0 p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (F (NOT (OR p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 611 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 319/319 transitions.
Applied a total of 0 rules in 0 ms. Remains 88 /88 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2023-03-10 16:13:05] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:05] [INFO ] Invariant cache hit.
[2023-03-10 16:13:05] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 16:13:05] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:05] [INFO ] Invariant cache hit.
[2023-03-10 16:13:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-10 16:13:05] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-10 16:13:05] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:05] [INFO ] Invariant cache hit.
[2023-03-10 16:13:06] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 88/88 places, 319/319 transitions.
Computed a total of 50 stabilizing places and 239 stable transitions
Graph (complete) has 937 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 50 stabilizing places and 239 stable transitions
Detected a total of 50/88 stabilizing places and 239/319 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 489 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 292 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :3
Finished Best-First random walk after 4861 steps, including 19 resets, run visited all 2 properties in 13 ms. (steps per millisecond=373 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1))))), (F (AND p0 p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (F (NOT (OR p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 606 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 94 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 319/319 transitions.
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 88 transition count 262
Applied a total of 57 rules in 15 ms. Remains 88 /88 variables (removed 0) and now considering 262/319 (removed 57) transitions.
[2023-03-10 16:13:08] [INFO ] Redundant transitions in 231 ms returned []
[2023-03-10 16:13:08] [INFO ] Flow matrix only has 119 transitions (discarded 143 similar events)
// Phase 1: matrix 119 rows 88 cols
[2023-03-10 16:13:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:13:08] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/88 places, 262/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 ms. Remains : 88/88 places, 262/319 transitions.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 319/319 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2023-03-10 16:13:08] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
// Phase 1: matrix 176 rows 88 cols
[2023-03-10 16:13:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 16:13:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-10 16:13:08] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:08] [INFO ] Invariant cache hit.
[2023-03-10 16:13:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-10 16:13:08] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-10 16:13:08] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-10 16:13:08] [INFO ] Invariant cache hit.
[2023-03-10 16:13:09] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 88/88 places, 319/319 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 6113 ms.
[2023-03-10 16:13:09] [INFO ] Flatten gal took : 35 ms
[2023-03-10 16:13:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 16:13:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 384 transitions and 2309 arcs took 6 ms.
Total runtime 38756 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1840/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1840/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudDeployment-PT-4a-LTLCardinality-01
Could not compute solution for formula : CloudDeployment-PT-4a-LTLCardinality-05

BK_STOP 1678464790605

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CloudDeployment-PT-4a-LTLCardinality-01
ltl formula formula --ltl=/tmp/1840/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 384 transitions and 2309 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1840/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CloudDeployment-PT-4a-LTLCardinality-05
ltl formula formula --ltl=/tmp/1840/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 384 transitions and 2309 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1840/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1840/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1840/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1840/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r073-smll-167814399500395"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;