fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r071-smll-167814397900395
Last Updated
May 14, 2023

About the Execution of LoLa+red for CloudDeployment-PT-4a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
409.188 41319.00 68994.00 871.50 TTTTFFFTFFTTFFTF normal

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.r071-smll-167814397900395.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 lolaxred
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 r071-smll-167814397900395
=====================================================================

--------------------
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 1678276732982

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 11:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:58:56] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-08 11:58:56] [INFO ] Transformed 141 places.
[2023-03-08 11:58:56] [INFO ] Transformed 475 transitions.
[2023-03-08 11:58:56] [INFO ] Found NUPN structural information;
[2023-03-08 11:58:56] [INFO ] Parsed PT model containing 141 places and 475 transitions and 2657 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 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 51 ms. Remains 132 /141 variables (removed 9) and now considering 384/423 (removed 39) transitions.
[2023-03-08 11:58:56] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-08 11:58:56] [INFO ] Computed 16 place invariants in 23 ms
[2023-03-08 11:58:57] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-08 11:58:57] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-08 11:58:57] [INFO ] Invariant cache hit.
[2023-03-08 11:58:57] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:58:57] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-08 11:58:57] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-08 11:58:57] [INFO ] Invariant cache hit.
[2023-03-08 11:58:58] [INFO ] Dead Transitions using invariants and state equation in 509 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 1322 ms. Remains : 132/141 places, 384/423 transitions.
Support contains 23 out of 132 places after structural reductions.
[2023-03-08 11:58:58] [INFO ] Flatten gal took : 131 ms
[2023-03-08 11:58:58] [INFO ] Flatten gal took : 65 ms
[2023-03-08 11:58:58] [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 2981 steps, including 48 resets, run visited all 14 properties in 208 ms. (steps per millisecond=14 )
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 19 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-08 11:58:59] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-08 11:58:59] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-08 11:58:59] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 11:58:59] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:58:59] [INFO ] Invariant cache hit.
[2023-03-08 11:58:59] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:58:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 11:58:59] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:58:59] [INFO ] Invariant cache hit.
[2023-03-08 11:58:59] [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 683 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 376 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 29393 reset in 1153 ms.
Product exploration explored 100000 steps with 29345 reset in 1038 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 207 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 260 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 166 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
Finished Best-First random walk after 1547 steps, including 4 resets, run visited all 1 properties in 6 ms. (steps per millisecond=257 )
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 259 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 258 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 239 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 4 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-08 11:59:03] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:03] [INFO ] Invariant cache hit.
[2023-03-08 11:59:03] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 11:59:03] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:03] [INFO ] Invariant cache hit.
[2023-03-08 11:59:04] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 11:59:04] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:04] [INFO ] Invariant cache hit.
[2023-03-08 11:59:04] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 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.8 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 146 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 226 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 155 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Finished Best-First random walk after 750 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=250 )
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 219 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 207 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 193 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 199 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 29278 reset in 913 ms.
Product exploration explored 100000 steps with 29351 reset in 912 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 247 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 5 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 0 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 73 ms. Remains 98 /130 variables (removed 32) and now considering 274/382 (removed 108) transitions.
[2023-03-08 11:59:08] [INFO ] Redundant transitions in 279 ms returned []
[2023-03-08 11:59:08] [INFO ] Flow matrix only has 131 transitions (discarded 143 similar events)
// Phase 1: matrix 131 rows 98 cols
[2023-03-08 11:59:08] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 11:59:08] [INFO ] Dead Transitions using invariants and state equation in 286 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 649 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 5 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-08 11:59:08] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-08 11:59:08] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-08 11:59:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 11:59:08] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:08] [INFO ] Invariant cache hit.
[2023-03-08 11:59:09] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:09] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-08 11:59:09] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:09] [INFO ] Invariant cache hit.
[2023-03-08 11:59:09] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 130/130 places, 382/382 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 10439 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 17 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-08 11:59:09] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:09] [INFO ] Invariant cache hit.
[2023-03-08 11:59:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 11:59:09] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:09] [INFO ] Invariant cache hit.
[2023-03-08 11:59:09] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:09] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-08 11:59:09] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:09] [INFO ] Invariant cache hit.
[2023-03-08 11:59:10] [INFO ] Dead Transitions using invariants and state equation in 234 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 532 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 197 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 298 ms.
Product exploration explored 100000 steps with 0 reset in 277 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.3 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) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT 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 565 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))]
Finished random walk after 8948 steps, including 150 resets, run visited all 5 properties in 222 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) p0))), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT 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 665 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 145 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 3 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-08 11:59:12] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:12] [INFO ] Invariant cache hit.
[2023-03-08 11:59:12] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 11:59:12] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:12] [INFO ] Invariant cache hit.
[2023-03-08 11:59:13] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:13] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-08 11:59:13] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:13] [INFO ] Invariant cache hit.
[2023-03-08 11:59:13] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 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.3 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 p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 p1 (NOT 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 600 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 170 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 176 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :3
Finished Best-First random walk after 1972 steps, including 5 resets, run visited all 2 properties in 12 ms. (steps per millisecond=164 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 p1 (NOT 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 701 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 211 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 192 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 1 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 56 ms. Remains 100 /130 variables (removed 30) and now considering 278/382 (removed 104) transitions.
[2023-03-08 11:59:16] [INFO ] Redundant transitions in 281 ms returned []
[2023-03-08 11:59:16] [INFO ] Flow matrix only has 135 transitions (discarded 143 similar events)
// Phase 1: matrix 135 rows 100 cols
[2023-03-08 11:59:16] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-08 11:59:16] [INFO ] Dead Transitions using invariants and state equation in 173 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 523 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 3 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-08 11:59:16] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-08 11:59:16] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 11:59:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 11:59:16] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:16] [INFO ] Invariant cache hit.
[2023-03-08 11:59:17] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:17] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-08 11:59:17] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:17] [INFO ] Invariant cache hit.
[2023-03-08 11:59:17] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 130/130 places, 382/382 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 7876 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 15 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-08 11:59:17] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:17] [INFO ] Invariant cache hit.
[2023-03-08 11:59:17] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 11:59:17] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:17] [INFO ] Invariant cache hit.
[2023-03-08 11:59:17] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-08 11:59:17] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-08 11:59:17] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-08 11:59:17] [INFO ] Invariant cache hit.
[2023-03-08 11:59:18] [INFO ] Dead Transitions using invariants and state equation in 253 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 650 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 126 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 1 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-06 finished in 798 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 1 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 62 ms. Remains 95 /132 variables (removed 37) and now considering 283/384 (removed 101) transitions.
[2023-03-08 11:59:18] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
// Phase 1: matrix 128 rows 95 cols
[2023-03-08 11:59:18] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-08 11:59:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 11:59:18] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-08 11:59:18] [INFO ] Invariant cache hit.
[2023-03-08 11:59:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 11:59:18] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-08 11:59:19] [INFO ] Redundant transitions in 291 ms returned []
[2023-03-08 11:59:19] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-08 11:59:19] [INFO ] Invariant cache hit.
[2023-03-08 11:59:19] [INFO ] Dead Transitions using invariants and state equation in 297 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 1020 ms. Remains : 95/132 places, 283/384 transitions.
Stuttering acceptance computed with spot in 302 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 1350 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 3 ms. Remains 132 /132 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2023-03-08 11:59:19] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-08 11:59:19] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-08 11:59:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 11:59:19] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-08 11:59:19] [INFO ] Invariant cache hit.
[2023-03-08 11:59:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:59:20] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-08 11:59:20] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-08 11:59:20] [INFO ] Invariant cache hit.
[2023-03-08 11:59:20] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 132/132 places, 384/384 transitions.
Stuttering acceptance computed with spot in 219 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 0 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4a-LTLCardinality-09 finished in 933 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 0 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-08 11:59:20] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2023-03-08 11:59:20] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 11:59:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 11:59:20] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-08 11:59:20] [INFO ] Invariant cache hit.
[2023-03-08 11:59:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-08 11:59:20] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-08 11:59:21] [INFO ] Redundant transitions in 314 ms returned []
[2023-03-08 11:59:21] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-08 11:59:21] [INFO ] Invariant cache hit.
[2023-03-08 11:59:21] [INFO ] Dead Transitions using invariants and state equation in 267 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 893 ms. Remains : 86/132 places, 258/384 transitions.
Stuttering acceptance computed with spot in 160 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 1282 ms.
Product exploration explored 100000 steps with 50000 reset in 1145 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.2 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 75 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 3573 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 180 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 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 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-08 11:59:24] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
// Phase 1: matrix 164 rows 86 cols
[2023-03-08 11:59:24] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 11:59:24] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 11:59:24] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:24] [INFO ] Invariant cache hit.
[2023-03-08 11:59:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 11:59:24] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-08 11:59:24] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:24] [INFO ] Invariant cache hit.
[2023-03-08 11:59:24] [INFO ] Dead Transitions using invariants and state equation in 306 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 557 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 28831 reset in 418 ms.
Product exploration explored 100000 steps with 28818 reset in 473 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.2 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 148 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 235 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 298 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Finished Best-First random walk after 2655 steps, including 10 resets, run visited all 1 properties in 5 ms. (steps per millisecond=531 )
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 300 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 268 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 266 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-08 11:59:27] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:27] [INFO ] Invariant cache hit.
[2023-03-08 11:59:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 11:59:27] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:27] [INFO ] Invariant cache hit.
[2023-03-08 11:59:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 11:59:27] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-08 11:59:27] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:27] [INFO ] Invariant cache hit.
[2023-03-08 11:59:27] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 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.2 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 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 245 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))]
Finished random walk after 949 steps, including 25 resets, run visited all 2 properties in 6 ms. (steps per millisecond=158 )
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 245 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 250 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 238 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 236 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 28820 reset in 573 ms.
Product exploration explored 100000 steps with 28791 reset in 452 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 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 17 ms. Remains 86 /86 variables (removed 0) and now considering 258/307 (removed 49) transitions.
[2023-03-08 11:59:30] [INFO ] Redundant transitions in 252 ms returned []
[2023-03-08 11:59:30] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2023-03-08 11:59:30] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-08 11:59:31] [INFO ] Dead Transitions using invariants and state equation in 230 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 507 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-08 11:59:31] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
// Phase 1: matrix 164 rows 86 cols
[2023-03-08 11:59:31] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-08 11:59:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 11:59:31] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:31] [INFO ] Invariant cache hit.
[2023-03-08 11:59:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 11:59:31] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-08 11:59:31] [INFO ] Flow matrix only has 164 transitions (discarded 143 similar events)
[2023-03-08 11:59:31] [INFO ] Invariant cache hit.
[2023-03-08 11:59:31] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 86/86 places, 307/307 transitions.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 7524 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 179 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 1 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 32 ms. Remains 88 /132 variables (removed 44) and now considering 319/384 (removed 65) transitions.
[2023-03-08 11:59:32] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
// Phase 1: matrix 176 rows 88 cols
[2023-03-08 11:59:32] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-08 11:59:32] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 11:59:32] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-08 11:59:32] [INFO ] Invariant cache hit.
[2023-03-08 11:59:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 11:59:32] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-08 11:59:32] [INFO ] Flow matrix only has 176 transitions (discarded 143 similar events)
[2023-03-08 11:59:32] [INFO ] Invariant cache hit.
[2023-03-08 11:59:32] [INFO ] Dead Transitions using invariants and state equation in 322 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 730 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 74 ms.
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 1209 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 11:59:32] [INFO ] Flatten gal took : 50 ms
[2023-03-08 11:59:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2023-03-08 11:59:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 384 transitions and 2309 arcs took 9 ms.
Total runtime 36837 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CloudDeployment-PT-4a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality

FORMULA CloudDeployment-PT-4a-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678276774301

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CloudDeployment-PT-4a-LTLCardinality-01
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CloudDeployment-PT-4a-LTLCardinality-01
lola: result : true
lola: markings : 198
lola: fired transitions : 444
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CloudDeployment-PT-4a-LTLCardinality-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CloudDeployment-PT-4a-LTLCardinality-05
lola: result : false
lola: markings : 41
lola: fired transitions : 132
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-4a-LTLCardinality-01: LTL true LTL model checker
CloudDeployment-PT-4a-LTLCardinality-05: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="lolaxred"
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 lolaxred"
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 r071-smll-167814397900395"
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 ;