MCC'2023- Execution of r165-tall-167838850500499

About the Execution of ITS-Tools for FlexibleBarrier-PT-10b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
466.380	30727.00	52463.00	834.30	FFTTFFFFFTFFFFTF	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.r165-tall-167838850500499.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 FlexibleBarrier-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850500499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K 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 FlexibleBarrier-PT-10b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679502276588

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=FlexibleBarrier-PT-10b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 16:24:38] [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-22 16:24:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:24:38] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-22 16:24:38] [INFO ] Transformed 1402 places.
[2023-03-22 16:24:38] [INFO ] Transformed 1613 transitions.
[2023-03-22 16:24:38] [INFO ] Found NUPN structural information;
[2023-03-22 16:24:38] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 531 places :
Symmetric choice reduction at 0 with 531 rule applications. Total rules 531 place count 871 transition count 1082
Iterating global reduction 0 with 531 rules applied. Total rules applied 1062 place count 871 transition count 1082
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 1305 place count 628 transition count 839
Iterating global reduction 0 with 243 rules applied. Total rules applied 1548 place count 628 transition count 839
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 1692 place count 484 transition count 695
Iterating global reduction 0 with 144 rules applied. Total rules applied 1836 place count 484 transition count 695
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1902 place count 484 transition count 629
Applied a total of 1902 rules in 219 ms. Remains 484 /1402 variables (removed 918) and now considering 629/1613 (removed 984) transitions.
// Phase 1: matrix 629 rows 484 cols
[2023-03-22 16:24:39] [INFO ] Computed 12 place invariants in 27 ms
[2023-03-22 16:24:39] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-22 16:24:39] [INFO ] Invariant cache hit.
[2023-03-22 16:24:40] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-22 16:24:40] [INFO ] Invariant cache hit.
[2023-03-22 16:24:40] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/1402 places, 629/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1217 ms. Remains : 484/1402 places, 629/1613 transitions.
Support contains 37 out of 484 places after structural reductions.
[2023-03-22 16:24:40] [INFO ] Flatten gal took : 63 ms
[2023-03-22 16:24:40] [INFO ] Flatten gal took : 34 ms
[2023-03-22 16:24:40] [INFO ] Input system was already deterministic with 629 transitions.
Support contains 35 out of 484 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 16:24:41] [INFO ] Invariant cache hit.
[2023-03-22 16:24:41] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 16:24:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 16:24:42] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 16:24:42] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 3 ms to minimize.
[2023-03-22 16:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-22 16:24:42] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-22 16:24:42] [INFO ] After 1058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 2 properties in 48 ms.
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 442 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 3 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 433 transition count 512
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 378 transition count 512
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 111 place count 378 transition count 492
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 151 place count 358 transition count 492
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 182 place count 327 transition count 461
Iterating global reduction 2 with 31 rules applied. Total rules applied 213 place count 327 transition count 461
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 219 place count 327 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 219 place count 327 transition count 454
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 221 place count 326 transition count 454
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 325 transition count 453
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 325 transition count 453
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 349 place count 262 transition count 390
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 369 place count 262 transition count 370
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 381 place count 250 transition count 358
Iterating global reduction 4 with 12 rules applied. Total rules applied 393 place count 250 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 395 place count 250 transition count 356
Free-agglomeration rule applied 188 times.
Iterating global reduction 5 with 188 rules applied. Total rules applied 583 place count 250 transition count 168
Reduce places removed 188 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 270 rules applied. Total rules applied 853 place count 57 transition count 87
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 860 place count 57 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 861 place count 56 transition count 79
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 55 vertex of which 18 / 55 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 863 place count 46 transition count 79
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 881 place count 46 transition count 61
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 881 place count 46 transition count 52
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 899 place count 37 transition count 52
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 907 place count 37 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 923 place count 29 transition count 36
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 931 place count 29 transition count 28
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 952 place count 16 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 953 place count 16 transition count 20
Applied a total of 953 rules in 119 ms. Remains 16 /484 variables (removed 468) and now considering 20/629 (removed 609) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 16/484 places, 20/629 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=16 )
Computed a total of 12 stabilizing places and 12 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' '!(((p0 U p1)&&X(X((X(X(!p2)) U ((p2&&X(X(!p2)))||X(X(G(!p2)))))))))'
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 467 transition count 612
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 467 transition count 612
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 467 transition count 606
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 460 transition count 599
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 460 transition count 599
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 460 transition count 595
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 459 transition count 594
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 459 transition count 594
Applied a total of 60 rules in 52 ms. Remains 459 /484 variables (removed 25) and now considering 594/629 (removed 35) transitions.
// Phase 1: matrix 594 rows 459 cols
[2023-03-22 16:24:43] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-22 16:24:43] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-22 16:24:43] [INFO ] Invariant cache hit.
[2023-03-22 16:24:43] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-22 16:24:43] [INFO ] Invariant cache hit.
[2023-03-22 16:24:43] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459/484 places, 594/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 459/484 places, 594/629 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p1) p2), true, (NOT p1), p2, p2, p2, p2]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 1}]], initial=0, aps=[p1:(EQ s425 1), p0:(OR (EQ s268 0) (EQ s200 1)), p2:(OR (EQ s85 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-01 finished in 1213 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(F(p1))||p0)))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 463 transition count 608
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 463 transition count 608
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 463 transition count 601
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 454 transition count 592
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 454 transition count 592
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 454 transition count 587
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 452 transition count 585
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 452 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 452 transition count 584
Applied a total of 77 rules in 33 ms. Remains 452 /484 variables (removed 32) and now considering 584/629 (removed 45) transitions.
// Phase 1: matrix 584 rows 452 cols
[2023-03-22 16:24:44] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-22 16:24:44] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-22 16:24:44] [INFO ] Invariant cache hit.
[2023-03-22 16:24:44] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-22 16:24:44] [INFO ] Invariant cache hit.
[2023-03-22 16:24:45] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/484 places, 584/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 452/484 places, 584/629 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s56 1)), p1:(OR (EQ s399 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-02 finished in 2031 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 U p1)&&F(G(p2))))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 464 transition count 609
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 464 transition count 609
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 464 transition count 604
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 454 transition count 594
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 454 transition count 594
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 454 transition count 588
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 452 transition count 586
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 452 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 452 transition count 585
Applied a total of 76 rules in 49 ms. Remains 452 /484 variables (removed 32) and now considering 585/629 (removed 44) transitions.
// Phase 1: matrix 585 rows 452 cols
[2023-03-22 16:24:46] [INFO ] Computed 12 place invariants in 17 ms
[2023-03-22 16:24:46] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-22 16:24:46] [INFO ] Invariant cache hit.
[2023-03-22 16:24:46] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-22 16:24:46] [INFO ] Invariant cache hit.
[2023-03-22 16:24:47] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/484 places, 585/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 763 ms. Remains : 452/484 places, 585/629 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s197 0) (EQ s366 1)), p2:(OR (EQ s343 0) (EQ s54 1))], 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 1310 reset in 210 ms.
Stack based approach found an accepted trace after 9268 steps with 120 reset with depth 93 and stack size 93 in 28 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-04 finished in 1205 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(X((p0&&X(G(p1)))))))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 462 transition count 607
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 462 transition count 607
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 462 transition count 600
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 451 transition count 589
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 451 transition count 589
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 451 transition count 582
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 449 transition count 580
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 449 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 449 transition count 579
Applied a total of 85 rules in 34 ms. Remains 449 /484 variables (removed 35) and now considering 579/629 (removed 50) transitions.
// Phase 1: matrix 579 rows 449 cols
[2023-03-22 16:24:47] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-22 16:24:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-22 16:24:47] [INFO ] Invariant cache hit.
[2023-03-22 16:24:48] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-22 16:24:48] [INFO ] Invariant cache hit.
[2023-03-22 16:24:48] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/484 places, 579/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 449/484 places, 579/629 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s440 0) (EQ s430 1)), p1:(AND (EQ s430 0) (EQ s440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-05 finished in 978 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 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 464 transition count 609
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 464 transition count 609
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 464 transition count 603
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 454 transition count 593
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 454 transition count 593
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 73 place count 454 transition count 586
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 452 transition count 584
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 452 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 452 transition count 583
Applied a total of 78 rules in 33 ms. Remains 452 /484 variables (removed 32) and now considering 583/629 (removed 46) transitions.
// Phase 1: matrix 583 rows 452 cols
[2023-03-22 16:24:48] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-22 16:24:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-22 16:24:48] [INFO ] Invariant cache hit.
[2023-03-22 16:24:49] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-22 16:24:49] [INFO ] Invariant cache hit.
[2023-03-22 16:24:49] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 452/484 places, 583/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 699 ms. Remains : 452/484 places, 583/629 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s419 0) (EQ s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-06 finished in 784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 465 transition count 610
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 465 transition count 610
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 465 transition count 603
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 456 transition count 594
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 456 transition count 594
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 456 transition count 589
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 454 transition count 587
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 454 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 454 transition count 586
Applied a total of 73 rules in 42 ms. Remains 454 /484 variables (removed 30) and now considering 586/629 (removed 43) transitions.
// Phase 1: matrix 586 rows 454 cols
[2023-03-22 16:24:49] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-22 16:24:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-22 16:24:49] [INFO ] Invariant cache hit.
[2023-03-22 16:24:49] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-22 16:24:49] [INFO ] Invariant cache hit.
[2023-03-22 16:24:50] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/484 places, 586/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 454/484 places, 586/629 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s234 0) (AND (EQ s28 0) (EQ s394 1))), p1:(NEQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1298 reset in 274 ms.
Product exploration explored 100000 steps with 1302 reset in 225 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 554754 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 554754 steps, saw 146825 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 16:24:54] [INFO ] Invariant cache hit.
[2023-03-22 16:24:54] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-22 16:24:54] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 16:24:54] [INFO ] After 213ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 16:24:54] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-22 16:24:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 16:24:55] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:24:55] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-22 16:24:55] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 586/586 transitions.
Graph (trivial) has 418 edges and 454 vertex of which 61 / 454 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 403 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 354 transition count 475
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 99 place count 354 transition count 454
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 141 place count 333 transition count 454
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 160 place count 314 transition count 435
Iterating global reduction 2 with 19 rules applied. Total rules applied 179 place count 314 transition count 435
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 305 place count 251 transition count 372
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 325 place count 251 transition count 352
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 335 place count 241 transition count 342
Iterating global reduction 3 with 10 rules applied. Total rules applied 345 place count 241 transition count 342
Free-agglomeration rule applied 185 times.
Iterating global reduction 3 with 185 rules applied. Total rules applied 530 place count 241 transition count 157
Reduce places removed 185 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 150 edges and 56 vertex of which 31 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 267 rules applied. Total rules applied 797 place count 31 transition count 76
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 832 place count 31 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 835 place count 24 transition count 40
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 845 place count 24 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 845 place count 24 transition count 25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 855 place count 19 transition count 25
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 859 place count 19 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 867 place count 15 transition count 17
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 8 with 2 rules applied. Total rules applied 869 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 870 place count 14 transition count 15
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 874 place count 14 transition count 11
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 885 place count 7 transition count 7
Applied a total of 885 rules in 67 ms. Remains 7 /454 variables (removed 447) and now considering 7/586 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 7/454 places, 7/586 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 404 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 586/586 transitions.
Applied a total of 0 rules in 13 ms. Remains 454 /454 variables (removed 0) and now considering 586/586 (removed 0) transitions.
[2023-03-22 16:24:56] [INFO ] Invariant cache hit.
[2023-03-22 16:24:56] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-22 16:24:56] [INFO ] Invariant cache hit.
[2023-03-22 16:24:56] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-22 16:24:56] [INFO ] Invariant cache hit.
[2023-03-22 16:24:56] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 454/454 places, 586/586 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 618958 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618958 steps, saw 161786 distinct states, run finished after 3002 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 16:25:00] [INFO ] Invariant cache hit.
[2023-03-22 16:25:00] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 16:25:00] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 16:25:00] [INFO ] After 216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 16:25:00] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-22 16:25:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 16:25:01] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 16:25:01] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-22 16:25:01] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 586/586 transitions.
Graph (trivial) has 418 edges and 454 vertex of which 61 / 454 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 403 transition count 475
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 354 transition count 475
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 99 place count 354 transition count 454
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 141 place count 333 transition count 454
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 160 place count 314 transition count 435
Iterating global reduction 2 with 19 rules applied. Total rules applied 179 place count 314 transition count 435
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 305 place count 251 transition count 372
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 325 place count 251 transition count 352
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 335 place count 241 transition count 342
Iterating global reduction 3 with 10 rules applied. Total rules applied 345 place count 241 transition count 342
Free-agglomeration rule applied 185 times.
Iterating global reduction 3 with 185 rules applied. Total rules applied 530 place count 241 transition count 157
Reduce places removed 185 places and 0 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 150 edges and 56 vertex of which 31 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 267 rules applied. Total rules applied 797 place count 31 transition count 76
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 832 place count 31 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 25 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 835 place count 24 transition count 40
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 845 place count 24 transition count 30
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 845 place count 24 transition count 25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 855 place count 19 transition count 25
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 859 place count 19 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 867 place count 15 transition count 17
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 8 with 2 rules applied. Total rules applied 869 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 870 place count 14 transition count 15
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 874 place count 14 transition count 11
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 885 place count 7 transition count 7
Applied a total of 885 rules in 46 ms. Remains 7 /454 variables (removed 447) and now considering 7/586 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 7/454 places, 7/586 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 1297 reset in 176 ms.
Entered a terminal (fully accepting) state of product in 41089 steps with 529 reset in 77 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-07 finished in 13012 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((X(F((p0||G(p1))))&&(F(p3)||p2))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 466 transition count 611
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 466 transition count 611
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 466 transition count 605
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 456 transition count 595
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 456 transition count 595
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 456 transition count 588
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 454 transition count 586
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 454 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 454 transition count 585
Applied a total of 74 rules in 33 ms. Remains 454 /484 variables (removed 30) and now considering 585/629 (removed 44) transitions.
// Phase 1: matrix 585 rows 454 cols
[2023-03-22 16:25:02] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-22 16:25:02] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-22 16:25:02] [INFO ] Invariant cache hit.
[2023-03-22 16:25:02] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-22 16:25:02] [INFO ] Invariant cache hit.
[2023-03-22 16:25:03] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/484 places, 585/629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 454/484 places, 585/629 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s333 0) (EQ s444 1)), p3:(OR (EQ s333 0) (EQ s444 1)), p0:(AND (EQ s444 0) (EQ s333 1)), p1:(AND (EQ s147 0) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-08 finished in 892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 446 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 3 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 432 transition count 523
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 379 transition count 523
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 107 place count 379 transition count 500
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 153 place count 356 transition count 500
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 187 place count 322 transition count 466
Iterating global reduction 2 with 34 rules applied. Total rules applied 221 place count 322 transition count 466
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 227 place count 322 transition count 460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 227 place count 322 transition count 459
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 229 place count 321 transition count 459
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 318 transition count 456
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 318 transition count 456
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 238 place count 318 transition count 453
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 362 place count 256 transition count 391
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 367 place count 251 transition count 386
Iterating global reduction 4 with 5 rules applied. Total rules applied 372 place count 251 transition count 386
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 377 place count 251 transition count 381
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 387 place count 251 transition count 371
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 389 place count 249 transition count 369
Applied a total of 389 rules in 136 ms. Remains 249 /484 variables (removed 235) and now considering 369/629 (removed 260) transitions.
[2023-03-22 16:25:03] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 249 cols
[2023-03-22 16:25:03] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-22 16:25:03] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-22 16:25:03] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2023-03-22 16:25:03] [INFO ] Invariant cache hit.
[2023-03-22 16:25:04] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-22 16:25:04] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 16:25:04] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2023-03-22 16:25:04] [INFO ] Invariant cache hit.
[2023-03-22 16:25:04] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/484 places, 369/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1024 ms. Remains : 249/484 places, 369/629 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s191 0) (EQ s58 1)), p1:(OR (EQ s114 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-10 finished in 1151 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 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 449 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 432 transition count 519
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 375 transition count 519
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 115 place count 375 transition count 499
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 155 place count 355 transition count 499
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 319 transition count 463
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 319 transition count 463
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 234 place count 319 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 319 transition count 455
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 236 place count 318 transition count 455
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 315 transition count 452
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 315 transition count 452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 245 place count 315 transition count 449
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 369 place count 253 transition count 387
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 373 place count 249 transition count 383
Iterating global reduction 4 with 4 rules applied. Total rules applied 377 place count 249 transition count 383
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 381 place count 249 transition count 379
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 391 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 247 transition count 367
Applied a total of 393 rules in 100 ms. Remains 247 /484 variables (removed 237) and now considering 367/629 (removed 262) transitions.
[2023-03-22 16:25:04] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
// Phase 1: matrix 349 rows 247 cols
[2023-03-22 16:25:04] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-22 16:25:04] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-22 16:25:04] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2023-03-22 16:25:04] [INFO ] Invariant cache hit.
[2023-03-22 16:25:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:25:05] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-22 16:25:05] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 16:25:05] [INFO ] Flow matrix only has 349 transitions (discarded 18 similar events)
[2023-03-22 16:25:05] [INFO ] Invariant cache hit.
[2023-03-22 16:25:05] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/484 places, 367/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 799 ms. Remains : 247/484 places, 367/629 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s246 0) (NEQ s20 1))], 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 FlexibleBarrier-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-12 finished in 864 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)||(p1 U p2)))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 629/629 transitions.
Graph (trivial) has 450 edges and 484 vertex of which 61 / 484 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 432 transition count 520
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 376 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 375 transition count 519
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 115 place count 375 transition count 499
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 155 place count 355 transition count 499
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 190 place count 320 transition count 464
Iterating global reduction 3 with 35 rules applied. Total rules applied 225 place count 320 transition count 464
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 231 place count 320 transition count 458
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 231 place count 320 transition count 457
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 319 transition count 457
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 316 transition count 454
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 316 transition count 454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 316 transition count 452
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 357 place count 258 transition count 394
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 362 place count 253 transition count 389
Iterating global reduction 5 with 5 rules applied. Total rules applied 367 place count 253 transition count 389
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 372 place count 253 transition count 384
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 382 place count 253 transition count 374
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 384 place count 251 transition count 372
Applied a total of 384 rules in 78 ms. Remains 251 /484 variables (removed 233) and now considering 372/629 (removed 257) transitions.
[2023-03-22 16:25:05] [INFO ] Flow matrix only has 353 transitions (discarded 19 similar events)
// Phase 1: matrix 353 rows 251 cols
[2023-03-22 16:25:05] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-22 16:25:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-22 16:25:05] [INFO ] Flow matrix only has 353 transitions (discarded 19 similar events)
[2023-03-22 16:25:05] [INFO ] Invariant cache hit.
[2023-03-22 16:25:05] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-22 16:25:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 16:25:05] [INFO ] Flow matrix only has 353 transitions (discarded 19 similar events)
[2023-03-22 16:25:05] [INFO ] Invariant cache hit.
[2023-03-22 16:25:05] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/484 places, 372/629 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 251/484 places, 372/629 transitions.
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s3 1), p1:(OR (EQ s36 0) (EQ s1 1)), p0:(EQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-15 finished in 917 ms.
All properties solved by simple procedures.
Total runtime 27377 ms.

BK_STOP 1679502307315

--------------------
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="FlexibleBarrier-PT-10b"
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 FlexibleBarrier-PT-10b, 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 r165-tall-167838850500499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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