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.r325-tall-167889197400619.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 RefineWMG-PT-025026, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197400619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 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 RefineWMG-PT-025026-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-025026-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679022256819

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=RefineWMG-PT-025026
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 03:04:18] [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-17 03:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 03:04:18] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-17 03:04:18] [INFO ] Transformed 129 places.
[2023-03-17 03:04:18] [INFO ] Transformed 103 transitions.
[2023-03-17 03:04:18] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-025026-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 18 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 03:04:18] [INFO ] Computed 52 place invariants in 14 ms
[2023-03-17 03:04:18] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2023-03-17 03:04:18] [INFO ] Invariant cache hit.
[2023-03-17 03:04:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-17 03:04:18] [INFO ] Invariant cache hit.
[2023-03-17 03:04:18] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-17 03:04:18] [INFO ] Invariant cache hit.
[2023-03-17 03:04:18] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 33 out of 129 places after structural reductions.
[2023-03-17 03:04:19] [INFO ] Flatten gal took : 28 ms
[2023-03-17 03:04:19] [INFO ] Flatten gal took : 13 ms
[2023-03-17 03:04:19] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 23) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-17 03:04:19] [INFO ] Invariant cache hit.
[2023-03-17 03:04:19] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2023-03-17 03:04:19] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-17 03:04:19] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-17 03:04:20] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-17 03:04:20] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-17 03:04:20] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Finished Parikh walk after 1621 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=231 )
Parikh walk visited 14 properties in 234 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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(p0)||X(X(X(F((p1||G(F(p1)))))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:21] [INFO ] Invariant cache hit.
[2023-03-17 03:04:21] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-17 03:04:21] [INFO ] Invariant cache hit.
[2023-03-17 03:04:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-17 03:04:21] [INFO ] Invariant cache hit.
[2023-03-17 03:04:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-17 03:04:21] [INFO ] Invariant cache hit.
[2023-03-17 03:04:21] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(AND (LEQ 3 s14) (LEQ 1 s39)), p1:(GT 3 s14)], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 439 ms.
Product exploration explored 100000 steps with 25000 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1042784 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1042784 steps, saw 915365 distinct states, run finished after 3002 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:04:25] [INFO ] Invariant cache hit.
[2023-03-17 03:04:25] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2023-03-17 03:04:25] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:04:26] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2023-03-17 03:04:26] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:04:26] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-17 03:04:26] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 441 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:26] [INFO ] Invariant cache hit.
[2023-03-17 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-17 03:04:26] [INFO ] Invariant cache hit.
[2023-03-17 03:04:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-17 03:04:26] [INFO ] Invariant cache hit.
[2023-03-17 03:04:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-17 03:04:26] [INFO ] Invariant cache hit.
[2023-03-17 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 129/129 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1152087 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1152087 steps, saw 1010268 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 03:04:30] [INFO ] Invariant cache hit.
[2023-03-17 03:04:30] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-17 03:04:30] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 03:04:30] [INFO ] [Nat]Absence check using 52 positive place invariants in 5 ms returned sat
[2023-03-17 03:04:30] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 03:04:30] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 03:04:30] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 442 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 234 ms.
Product exploration explored 100000 steps with 25000 reset in 251 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 6 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 50 place count 79 transition count 54
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 50 rules in 19 ms. Remains 79 /129 variables (removed 50) and now considering 54/103 (removed 49) transitions.
// Phase 1: matrix 54 rows 79 cols
[2023-03-17 03:04:31] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-17 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 03:04:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 03:04:31] [INFO ] Invariant cache hit.
[2023-03-17 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/129 places, 54/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 79/129 places, 54/103 transitions.
Built C files in :
/tmp/ltsmin14248304730972688346
[2023-03-17 03:04:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14248304730972688346
Running compilation step : cd /tmp/ltsmin14248304730972688346;'/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 279 ms.
Running link step : cd /tmp/ltsmin14248304730972688346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14248304730972688346;'/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/stateBased16113275012716936534.hoa' '--buchi-type=spotba'
LTSmin run took 2407 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-025026-LTLCardinality-00 finished in 13785 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||G(p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 115 place count 33 transition count 13
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 134 place count 14 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 14 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 12 transition count 11
Applied a total of 138 rules in 11 ms. Remains 12 /129 variables (removed 117) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-17 03:04:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 03:04:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-17 03:04:34] [INFO ] Invariant cache hit.
[2023-03-17 03:04:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 03:04:34] [INFO ] Invariant cache hit.
[2023-03-17 03:04:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 03:04:34] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 03:04:34] [INFO ] Invariant cache hit.
[2023-03-17 03:04:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/129 places, 11/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 12/129 places, 11/103 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ s11 s3) (LEQ 2 s6)), p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-01 finished in 200 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((F(G(p0)) U G(p1))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 03:04:34] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-17 03:04:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s65), p0:(GT 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 339 ms.
Stack based approach found an accepted trace after 254 steps with 0 reset with depth 255 and stack size 253 in 2 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-04 finished in 715 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((p0||F(p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-17 03:04:35] [INFO ] Invariant cache hit.
[2023-03-17 03:04:35] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ s54 s41), p0:(LEQ 2 s66)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-025026-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025026-LTLCardinality-05 finished in 958 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 U p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:36] [INFO ] Invariant cache hit.
[2023-03-17 03:04:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-17 03:04:36] [INFO ] Invariant cache hit.
[2023-03-17 03:04:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 03:04:36] [INFO ] Invariant cache hit.
[2023-03-17 03:04:36] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-17 03:04:36] [INFO ] Invariant cache hit.
[2023-03-17 03:04:36] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s27 s80), p0:(GT s44 s110)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-06 finished in 373 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((F(p0)&&X(G((p1||(p0 U (p2||G(p0)))))))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:36] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(GT s55 s57), p2:(AND (GT s114 s101) (GT s118 s34)), p0:(GT s118 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-07 finished in 451 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(F((F(p0)&&G(p1)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-17 03:04:37] [INFO ] Invariant cache hit.
[2023-03-17 03:04:37] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GT s17 s82) (GT 3 s18)), p0:(LEQ s17 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 36 reset in 343 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 98 in 2 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-09 finished in 741 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(G((p0||F(p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 93 place count 35 transition count 33
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 109 place count 35 transition count 17
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 126 place count 19 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 18 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 127 place count 18 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 15 transition count 13
Applied a total of 133 rules in 6 ms. Remains 15 /129 variables (removed 114) and now considering 13/103 (removed 90) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-17 03:04:38] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 03:04:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-17 03:04:38] [INFO ] Invariant cache hit.
[2023-03-17 03:04:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 03:04:38] [INFO ] Invariant cache hit.
[2023-03-17 03:04:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 03:04:38] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 03:04:38] [INFO ] Invariant cache hit.
[2023-03-17 03:04:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/129 places, 13/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 15/129 places, 13/103 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 s8), p1:(LEQ s11 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 160 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-17 03:04:39] [INFO ] Invariant cache hit.
[2023-03-17 03:04:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-17 03:04:39] [INFO ] Invariant cache hit.
[2023-03-17 03:04:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 03:04:39] [INFO ] Invariant cache hit.
[2023-03-17 03:04:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 03:04:39] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-17 03:04:39] [INFO ] Invariant cache hit.
[2023-03-17 03:04:39] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 15/15 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 263 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-11 finished in 1842 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 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 117 place count 33 transition count 11
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 138 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 12 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 11 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 03:04:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 03:04:40] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s8)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-13 finished in 148 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(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 94 place count 33 transition count 31
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 114 place count 33 transition count 11
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 134 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 10 transition count 8
Applied a total of 140 rules in 7 ms. Remains 10 /129 variables (removed 119) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-17 03:04:40] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 03:04:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 8/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 10/129 places, 8/103 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-14 finished in 138 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((p0||X((X(p1)||(!p1&&X(p2)))))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-17 03:04:40] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-17 03:04:40] [INFO ] Invariant cache hit.
[2023-03-17 03:04:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : RefineWMG-PT-025026-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s45 s70), p1:(LEQ 2 s24), p2:(GT 3 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1067 steps with 0 reset in 8 ms.
FORMULA RefineWMG-PT-025026-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-LTLCardinality-15 finished in 407 ms.
All properties solved by simple procedures.
Total runtime 22515 ms.

BK_STOP 1679022281714

--------------------
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="RefineWMG-PT-025026"
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 RefineWMG-PT-025026, 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 r325-tall-167889197400619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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