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

About the Execution of LoLa+red for DNAwalker-PT-16redondantChoiceR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
726.907 141868.00 158286.00 611.90 TF?TTTTFFTTTFFTF 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.r103-tall-167814479000995.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479000995
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678304217015

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 19:36:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 19:36:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:36:58] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-08 19:36:58] [INFO ] Transformed 43 places.
[2023-03-08 19:36:58] [INFO ] Transformed 490 transitions.
[2023-03-08 19:36:58] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 175 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 DNAwalker-PT-16redondantChoiceR-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:36:58] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-08 19:36:58] [INFO ] Computed 0 place invariants in 13 ms
[2023-03-08 19:36:59] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
[2023-03-08 19:36:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:36:59] [INFO ] Invariant cache hit.
[2023-03-08 19:36:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 19:36:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:36:59] [INFO ] Invariant cache hit.
[2023-03-08 19:36:59] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:36:59] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-08 19:36:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:36:59] [INFO ] Invariant cache hit.
[2023-03-08 19:37:00] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1250 ms. Remains : 43/43 places, 490/490 transitions.
Support contains 30 out of 43 places after structural reductions.
[2023-03-08 19:37:00] [INFO ] Flatten gal took : 45 ms
[2023-03-08 19:37:00] [INFO ] Flatten gal took : 29 ms
[2023-03-08 19:37:00] [INFO ] Input system was already deterministic with 490 transitions.
Support contains 28 out of 43 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 378 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 19:37:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:37:00] [INFO ] Invariant cache hit.
[2023-03-08 19:37:01] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 19:37:26] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 27 place count 33 transition count 463
Applied a total of 27 rules in 39 ms. Remains 33 /43 variables (removed 10) and now considering 463/490 (removed 27) transitions.
// Phase 1: matrix 463 rows 33 cols
[2023-03-08 19:37:26] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-08 19:37:26] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 33/43 places, 463/490 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 568958 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568958 steps, saw 145410 distinct states, run finished after 3003 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 19:37:29] [INFO ] Invariant cache hit.
[2023-03-08 19:37:29] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 19:37:52] [INFO ] After 22361ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 18 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 33/33 places, 463/463 transitions.
Incomplete random walk after 10000 steps, including 417 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 615749 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615749 steps, saw 156475 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 19:37:55] [INFO ] Invariant cache hit.
[2023-03-08 19:37:55] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 19:38:08] [INFO ] After 12604ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 463/463 transitions.
Graph (complete) has 463 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 31 transition count 456
Applied a total of 8 rules in 18 ms. Remains 31 /33 variables (removed 2) and now considering 456/463 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 31/33 places, 456/463 transitions.
Incomplete random walk after 10000 steps, including 359 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1075381 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1075381 steps, saw 295092 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 456 rows 31 cols
[2023-03-08 19:38:11] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-08 19:38:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:38:22] [INFO ] After 10665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 13 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-08 19:38:22] [INFO ] Invariant cache hit.
[2023-03-08 19:38:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 19:38:22] [INFO ] Invariant cache hit.
[2023-03-08 19:38:22] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-08 19:38:22] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-08 19:38:22] [INFO ] Invariant cache hit.
[2023-03-08 19:38:22] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 19:38:22] [INFO ] Invariant cache hit.
[2023-03-08 19:38:22] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 19:38:33] [INFO ] After 10688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 43 stabilizing places and 488 stable transitions
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&F(p1)&&X((!p2 U (p3||G(!p2)))))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-08 19:38:33] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-08 19:38:33] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-08 19:38:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:33] [INFO ] Invariant cache hit.
[2023-03-08 19:38:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 19:38:34] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:34] [INFO ] Invariant cache hit.
[2023-03-08 19:38:34] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:35] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2023-03-08 19:38:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:35] [INFO ] Invariant cache hit.
[2023-03-08 19:38:35] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1391 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT 2 s42) (AND (GT 1 s5) (GT s15 s2))), p1:(GT 2 s32), p3:(GT 2 s42), p2:(AND (OR (LEQ 1 s5) (LEQ s15 s2)) (LEQ 2 s42))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p3 (NOT p2))
Knowledge based reduction with 19 factoid took 949 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 finished in 3304 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(((X((G(p0)&&p1)) U p1)||F(p2)||p0))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 16 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:37] [INFO ] Invariant cache hit.
[2023-03-08 19:38:37] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2023-03-08 19:38:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:37] [INFO ] Invariant cache hit.
[2023-03-08 19:38:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 19:38:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:37] [INFO ] Invariant cache hit.
[2023-03-08 19:38:37] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:38] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-03-08 19:38:38] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 19:38:38] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:38] [INFO ] Invariant cache hit.
[2023-03-08 19:38:38] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1315 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s34 s3), p1:(LEQ s29 s5), p2:(LEQ s16 s34)], 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 138 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 452 steps, including 17 resets, run visited all 2 properties in 6 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 15 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:39] [INFO ] Invariant cache hit.
[2023-03-08 19:38:39] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2023-03-08 19:38:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:39] [INFO ] Invariant cache hit.
[2023-03-08 19:38:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 19:38:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:39] [INFO ] Invariant cache hit.
[2023-03-08 19:38:39] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:40] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-08 19:38:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:38:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:40] [INFO ] Invariant cache hit.
[2023-03-08 19:38:40] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1223 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 7870 steps, including 296 resets, run visited all 2 properties in 45 ms. (steps per millisecond=174 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))]
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 169 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:42] [INFO ] Invariant cache hit.
[2023-03-08 19:38:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-08 19:38:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:42] [INFO ] Invariant cache hit.
[2023-03-08 19:38:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 19:38:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:42] [INFO ] Invariant cache hit.
[2023-03-08 19:38:42] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:42] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-08 19:38:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:38:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:43] [INFO ] Invariant cache hit.
[2023-03-08 19:38:43] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1097 ms. Remains : 43/43 places, 490/490 transitions.
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 finished in 6099 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)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:43] [INFO ] Invariant cache hit.
[2023-03-08 19:38:43] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2023-03-08 19:38:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:43] [INFO ] Invariant cache hit.
[2023-03-08 19:38:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 19:38:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:43] [INFO ] Invariant cache hit.
[2023-03-08 19:38:43] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:44] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-08 19:38:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:44] [INFO ] Invariant cache hit.
[2023-03-08 19:38:44] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1221 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s7 s20)], 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][false, false]]
Stuttering criterion allowed to conclude after 39 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 finished in 1326 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)||(p1&&F(p2)))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:44] [INFO ] Invariant cache hit.
[2023-03-08 19:38:44] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2023-03-08 19:38:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:44] [INFO ] Invariant cache hit.
[2023-03-08 19:38:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 19:38:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:44] [INFO ] Invariant cache hit.
[2023-03-08 19:38:44] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:45] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2023-03-08 19:38:45] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:45] [INFO ] Invariant cache hit.
[2023-03-08 19:38:45] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1073 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s36 s7), p1:(GT s22 s18), p2:(LEQ s20 s15)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 9 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 finished in 1233 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)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:45] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:45] [INFO ] Invariant cache hit.
[2023-03-08 19:38:45] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2023-03-08 19:38:45] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:45] [INFO ] Invariant cache hit.
[2023-03-08 19:38:45] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 19:38:45] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:45] [INFO ] Invariant cache hit.
[2023-03-08 19:38:46] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:47] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2023-03-08 19:38:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:38:47] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:47] [INFO ] Invariant cache hit.
[2023-03-08 19:38:47] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1390 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s8 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:48] [INFO ] Invariant cache hit.
[2023-03-08 19:38:48] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
[2023-03-08 19:38:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:48] [INFO ] Invariant cache hit.
[2023-03-08 19:38:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 19:38:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:48] [INFO ] Invariant cache hit.
[2023-03-08 19:38:48] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:49] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-08 19:38:49] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 19:38:49] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:49] [INFO ] Invariant cache hit.
[2023-03-08 19:38:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1140 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 69 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 finished in 4042 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(G(p0)) U G(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:49] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:49] [INFO ] Invariant cache hit.
[2023-03-08 19:38:49] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2023-03-08 19:38:49] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:49] [INFO ] Invariant cache hit.
[2023-03-08 19:38:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 19:38:50] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:50] [INFO ] Invariant cache hit.
[2023-03-08 19:38:50] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:50] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2023-03-08 19:38:50] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:50] [INFO ] Invariant cache hit.
[2023-03-08 19:38:51] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1288 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 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=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s21 s17), p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 4 reset in 2 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 finished in 1520 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)&&X(G(p1))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-08 19:38:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:51] [INFO ] Invariant cache hit.
[2023-03-08 19:38:51] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2023-03-08 19:38:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:51] [INFO ] Invariant cache hit.
[2023-03-08 19:38:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 19:38:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:51] [INFO ] Invariant cache hit.
[2023-03-08 19:38:51] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-08 19:38:52] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-03-08 19:38:52] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-08 19:38:52] [INFO ] Invariant cache hit.
[2023-03-08 19:38:52] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s14 s41), p0:(LEQ s28 s0)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 finished in 1388 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(((X((G(p0)&&p1)) U p1)||F(p2)||p0))))'
[2023-03-08 19:38:52] [INFO ] Flatten gal took : 24 ms
[2023-03-08 19:38:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 19:38:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 490 transitions and 1438 arcs took 3 ms.
Total runtime 114486 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DNAwalker-PT-16redondantChoiceR
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/359
LTLCardinality

BK_STOP 1678304358883

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/359/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/359/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/359/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DNAwalker-PT-16redondantChoiceR-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 9/32 DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 1240462 m, 248092 m/sec, 6071816 t fired, .

Time elapsed: 5 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 16/32 DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 2312224 m, 214352 m/sec, 12470611 t fired, .

Time elapsed: 10 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 23/32 DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 3450044 m, 227564 m/sec, 17941018 t fired, .

Time elapsed: 15 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 29/32 DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 4389400 m, 187871 m/sec, 23472980 t fired, .

Time elapsed: 20 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DNAwalker-PT-16redondantChoiceR-LTLCardinality-02: LTL unknown AGGR


Time elapsed: 25 secs. Pages in use: 32

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="DNAwalker-PT-16redondantChoiceR"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DNAwalker-PT-16redondantChoiceR, 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 r103-tall-167814479000995"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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