About the Execution of ITS-Tools for CloudDeployment-PT-4a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 512.111 | 41569.00 | 74691.00 | 846.80 | 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.r069-smll-167814396300395.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 itstools
Input is CloudDeployment-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396300395
=====================================================================
--------------------
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 1678439714280
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 09:15:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 09:15:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:15:17] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2023-03-10 09:15:17] [INFO ] Transformed 141 places.
[2023-03-10 09:15:17] [INFO ] Transformed 475 transitions.
[2023-03-10 09:15:17] [INFO ] Found NUPN structural information;
[2023-03-10 09:15:17] [INFO ] Parsed PT model containing 141 places and 475 transitions and 2657 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 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 78 ms. Remains 132 /141 variables (removed 9) and now considering 384/423 (removed 39) transitions.
[2023-03-10 09:15:17] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-10 09:15:17] [INFO ] Computed 16 place invariants in 35 ms
[2023-03-10 09:15:18] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-10 09:15:18] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 09:15:18] [INFO ] Invariant cache hit.
[2023-03-10 09:15:18] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-10 09:15:18] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-10 09:15:18] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 09:15:18] [INFO ] Invariant cache hit.
[2023-03-10 09:15:19] [INFO ] Dead Transitions using invariants and state equation in 414 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 1477 ms. Remains : 132/141 places, 384/423 transitions.
Support contains 23 out of 132 places after structural reductions.
[2023-03-10 09:15:19] [INFO ] Flatten gal took : 105 ms
[2023-03-10 09:15:19] [INFO ] Flatten gal took : 42 ms
[2023-03-10 09:15:19] [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 4038 steps, including 68 resets, run visited all 14 properties in 258 ms. (steps per millisecond=15 )
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-10 09:15:20] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 09:15:20] [INFO ] Computed 16 place invariants in 12 ms
[2023-03-10 09:15:20] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-10 09:15:20] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:20] [INFO ] Invariant cache hit.
[2023-03-10 09:15:20] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:20] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-10 09:15:20] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:20] [INFO ] Invariant cache hit.
[2023-03-10 09:15:21] [INFO ] Dead Transitions using invariants and state equation in 508 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 1024 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 497 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 29380 reset in 1363 ms.
Product exploration explored 100000 steps with 29371 reset in 1182 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 215 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 361 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 151 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :1
Finished Best-First random walk after 263 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=131 )
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 315 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))]
Stuttering acceptance computed with spot in 240 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 8 ms. Remains 130 /130 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-10 09:15:26] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:26] [INFO ] Invariant cache hit.
[2023-03-10 09:15:26] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-10 09:15:26] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:26] [INFO ] Invariant cache hit.
[2023-03-10 09:15:26] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:26] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-10 09:15:26] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:26] [INFO ] Invariant cache hit.
[2023-03-10 09:15:26] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 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 203 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 750 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 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Finished Best-First random walk after 249 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
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 268 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 264 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 272 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 269 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 29315 reset in 1263 ms.
Product exploration explored 100000 steps with 29296 reset in 934 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 274 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 8 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 82 ms. Remains 98 /130 variables (removed 32) and now considering 274/382 (removed 108) transitions.
[2023-03-10 09:15:32] [INFO ] Redundant transitions in 288 ms returned []
[2023-03-10 09:15:32] [INFO ] Flow matrix only has 131 transitions (discarded 143 similar events)
// Phase 1: matrix 131 rows 98 cols
[2023-03-10 09:15:32] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 09:15:32] [INFO ] Dead Transitions using invariants and state equation in 225 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 608 ms. Remains : 98/130 places, 274/382 transitions.
Built C files in :
/tmp/ltsmin2140435332881227091
[2023-03-10 09:15:32] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2140435332881227091
Running compilation step : cd /tmp/ltsmin2140435332881227091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1092 ms.
Running link step : cd /tmp/ltsmin2140435332881227091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2140435332881227091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7476989737964621750.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-4a-LTLCardinality-01 finished in 13714 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 18 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-10 09:15:33] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 09:15:33] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 09:15:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 09:15:34] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:34] [INFO ] Invariant cache hit.
[2023-03-10 09:15:34] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:34] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-10 09:15:34] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:34] [INFO ] Invariant cache hit.
[2023-03-10 09:15:34] [INFO ] Dead Transitions using invariants and state equation in 441 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 925 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 239 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 435 ms.
Product exploration explored 100000 steps with 0 reset in 466 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 714 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 184 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 176 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 09:15:37] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:37] [INFO ] Invariant cache hit.
[2023-03-10 09:15:37] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 09:15:37] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-10 09:15:37] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 09:15:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:37] [INFO ] After 51ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 09:15:38] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-10 09:15:38] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 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 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 103 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 103 ms. Remains : 80/130 places, 223/382 transitions.
Finished random walk after 2832 steps, including 57 resets, run visited all 2 properties in 91 ms. (steps per millisecond=31 )
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 817 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 210 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 202 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-10 09:15:39] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:39] [INFO ] Invariant cache hit.
[2023-03-10 09:15:39] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-10 09:15:39] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:39] [INFO ] Invariant cache hit.
[2023-03-10 09:15:39] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:40] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-10 09:15:40] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:40] [INFO ] Invariant cache hit.
[2023-03-10 09:15:40] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 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.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/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 759 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 227 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 167 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Finished Best-First random walk after 4964 steps, including 15 resets, run visited all 2 properties in 21 ms. (steps per millisecond=236 )
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 1118 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 206 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 193 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 0 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 56 ms. Remains 100 /130 variables (removed 30) and now considering 278/382 (removed 104) transitions.
[2023-03-10 09:15:44] [INFO ] Redundant transitions in 356 ms returned []
[2023-03-10 09:15:44] [INFO ] Flow matrix only has 135 transitions (discarded 143 similar events)
// Phase 1: matrix 135 rows 100 cols
[2023-03-10 09:15:44] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 09:15:45] [INFO ] Dead Transitions using invariants and state equation in 257 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 684 ms. Remains : 100/130 places, 278/382 transitions.
Built C files in :
/tmp/ltsmin14925029762407877932
[2023-03-10 09:15:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14925029762407877932
Running compilation step : cd /tmp/ltsmin14925029762407877932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1212 ms.
Running link step : cd /tmp/ltsmin14925029762407877932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14925029762407877932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18227068298200535207.hoa' '--buchi-type=spotba'
LTSmin run took 1246 ms.
FORMULA CloudDeployment-PT-4a-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-4a-LTLCardinality-05 finished in 13662 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 6 ms. Remains 130 /132 variables (removed 2) and now considering 382/384 (removed 2) transitions.
[2023-03-10 09:15:47] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
// Phase 1: matrix 223 rows 130 cols
[2023-03-10 09:15:47] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 09:15:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 09:15:47] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:47] [INFO ] Invariant cache hit.
[2023-03-10 09:15:47] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-10 09:15:48] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-10 09:15:48] [INFO ] Flow matrix only has 223 transitions (discarded 159 similar events)
[2023-03-10 09:15:48] [INFO ] Invariant cache hit.
[2023-03-10 09:15:48] [INFO ] Dead Transitions using invariants and state equation in 462 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 805 ms. Remains : 130/132 places, 382/384 transitions.
Stuttering acceptance computed with spot in 132 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 1039 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 1 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 104 ms. Remains 95 /132 variables (removed 37) and now considering 283/384 (removed 101) transitions.
[2023-03-10 09:15:48] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
// Phase 1: matrix 128 rows 95 cols
[2023-03-10 09:15:48] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-10 09:15:48] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-10 09:15:48] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-10 09:15:48] [INFO ] Invariant cache hit.
[2023-03-10 09:15:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 09:15:49] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-10 09:15:49] [INFO ] Redundant transitions in 359 ms returned []
[2023-03-10 09:15:49] [INFO ] Flow matrix only has 128 transitions (discarded 155 similar events)
[2023-03-10 09:15:49] [INFO ] Invariant cache hit.
[2023-03-10 09:15:49] [INFO ] Dead Transitions using invariants and state equation in 274 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 1296 ms. Remains : 95/132 places, 283/384 transitions.
Stuttering acceptance computed with spot in 183 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 1512 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 09:15:50] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 132 cols
[2023-03-10 09:15:50] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-10 09:15:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 09:15:50] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 09:15:50] [INFO ] Invariant cache hit.
[2023-03-10 09:15:50] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-10 09:15:50] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-10 09:15:50] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2023-03-10 09:15:50] [INFO ] Invariant cache hit.
[2023-03-10 09:15:50] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 132/132 places, 384/384 transitions.
Stuttering acceptance computed with spot in 229 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 835 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 42 ms. Remains 86 /132 variables (removed 46) and now considering 258/384 (removed 126) transitions.
[2023-03-10 09:15:51] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
// Phase 1: matrix 115 rows 86 cols
[2023-03-10 09:15:51] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-10 09:15:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-10 09:15:51] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-10 09:15:51] [INFO ] Invariant cache hit.
[2023-03-10 09:15:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-10 09:15:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-10 09:15:51] [INFO ] Redundant transitions in 281 ms returned []
[2023-03-10 09:15:51] [INFO ] Flow matrix only has 115 transitions (discarded 143 similar events)
[2023-03-10 09:15:51] [INFO ] Invariant cache hit.
[2023-03-10 09:15:51] [INFO ] Dead Transitions using invariants and state equation in 297 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 923 ms. Remains : 86/132 places, 258/384 transitions.
Stuttering acceptance computed with spot in 47 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 1147 ms.
Product exploration explored 100000 steps with 50000 reset in 1601 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 3828 ms.
All properties solved by simple procedures.
Total runtime 37878 ms.
BK_STOP 1678439755849
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-4a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-4a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-167814396300395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;