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.r489-tall-167912707601059.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 ltsminxred
Input is UtilityControlRoom-COL-Z4T4N04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707601059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 14:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679336994841

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:29:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:29:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 18:29:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:29:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2023-03-20 18:29:57] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:29:57] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2023-03-20 18:29:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-20 18:29:57] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 18:29:57] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:29:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-20 18:29:57] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-20 18:29:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-20 18:29:57] [INFO ] Flatten gal took : 15 ms
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:29:57] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 18:29:57] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 17 ms.
[2023-03-20 18:29:57] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
Support contains 150 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 13 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2023-03-20 18:29:57] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-20 18:29:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 18:29:57] [INFO ] Invariant cache hit.
[2023-03-20 18:29:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-20 18:29:58] [INFO ] Invariant cache hit.
[2023-03-20 18:29:58] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 154/154 places, 236/236 transitions.
Support contains 150 out of 154 places after structural reductions.
[2023-03-20 18:29:58] [INFO ] Flatten gal took : 23 ms
[2023-03-20 18:29:58] [INFO ] Flatten gal took : 22 ms
[2023-03-20 18:29:58] [INFO ] Input system was already deterministic with 236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 18:29:58] [INFO ] Invariant cache hit.
[2023-03-20 18:29:58] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:29:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-20 18:29:58] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(p1))))'
Support contains 84 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-20 18:29:58] [INFO ] Invariant cache hit.
[2023-03-20 18:29:59] [INFO ] Implicit Places using invariants in 94 ms returned [124, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/154 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 152/154 places, 236/236 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-02 finished in 450 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 X((G(p1)||(p1&&G(F(p2))))))))'
Support contains 37 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 13 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 18:29:59] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-20 18:29:59] [INFO ] Implicit Places using invariants in 62 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/154 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 105/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 537 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ s76 (ADD s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23)), p1:(LEQ 3 (ADD s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5406 reset in 389 ms.
Product exploration explored 100000 steps with 5352 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 481 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :7
Finished Best-First random walk after 1354 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=451 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 479 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
// Phase 1: matrix 188 rows 105 cols
[2023-03-20 18:30:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-20 18:30:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-03 finished in 3990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(!p0)))))'
Support contains 80 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2023-03-20 18:30:03] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-20 18:30:03] [INFO ] Implicit Places using invariants in 97 ms returned [124, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/154 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 152/154 places, 236/236 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, true, true, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11028 reset in 284 ms.
Product exploration explored 100000 steps with 11286 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
// Phase 1: matrix 236 rows 152 cols
[2023-03-20 18:30:04] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 18:30:04] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-20 18:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:05] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-20 18:30:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:30:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:05] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-20 18:30:05] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 18:30:06] [INFO ] Added : 232 causal constraints over 47 iterations in 778 ms. Result :sat
Could not prove EG p0
Support contains 80 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 236/236 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 128 transition count 212
Applied a total of 48 rules in 36 ms. Remains 128 /152 variables (removed 24) and now considering 212/236 (removed 24) transitions.
// Phase 1: matrix 212 rows 128 cols
[2023-03-20 18:30:06] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-20 18:30:06] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 18:30:06] [INFO ] Invariant cache hit.
[2023-03-20 18:30:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-20 18:30:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 18:30:06] [INFO ] Invariant cache hit.
[2023-03-20 18:30:06] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/152 places, 212/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 128/152 places, 212/236 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
[2023-03-20 18:30:06] [INFO ] Invariant cache hit.
[2023-03-20 18:30:06] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-20 18:30:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:30:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:07] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-20 18:30:07] [INFO ] Computed and/alt/rep : 196/352/196 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 18:30:07] [INFO ] Added : 136 causal constraints over 28 iterations in 390 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Product exploration explored 100000 steps with 13914 reset in 290 ms.
Stack based approach found an accepted trace after 13537 steps with 1820 reset with depth 23 and stack size 23 in 40 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-04 finished in 4721 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 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 59 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 59 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 47 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 47 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 35 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 35 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 35 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 35 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 31 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 26 transition count 24
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 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 292 place count 21 transition count 20
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 3 with 8 rules applied. Total rules applied 300 place count 17 transition count 16
Applied a total of 300 rules in 22 ms. Remains 17 /154 variables (removed 137) and now considering 16/236 (removed 220) transitions.
// Phase 1: matrix 16 rows 17 cols
[2023-03-20 18:30:08] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 18:30:08] [INFO ] Implicit Places using invariants in 31 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/154 places, 16/236 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 8 transition count 12
Applied a total of 12 rules in 2 ms. Remains 8 /16 variables (removed 8) and now considering 12/16 (removed 4) transitions.
[2023-03-20 18:30:08] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2023-03-20 18:30:08] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 18:30:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 18:30:08] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2023-03-20 18:30:08] [INFO ] Invariant cache hit.
[2023-03-20 18:30:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/154 places, 12/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 8/154 places, 12/236 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s4 s5 s6 s7))], 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 UtilityControlRoom-COL-Z4T4N04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-05 finished in 159 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(F(p1))||G(p0)))))'
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 12 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 18:30:08] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-20 18:30:08] [INFO ] Implicit Places using invariants in 89 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/154 places, 188/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 105/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s72 s73 s74 s75) (ADD s85 s86 s87 s88)), p0:(GT s76 (ADD s72 s73 s74 s75))], 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]]
Product exploration explored 100000 steps with 1345 reset in 197 ms.
Product exploration explored 100000 steps with 1472 reset in 207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 306 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 384 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 188 rows 105 cols
[2023-03-20 18:30:10] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-20 18:30:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-20 18:30:10] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-20 18:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:30:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:10] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-20 18:30:10] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-20 18:30:11] [INFO ] Added : 117 causal constraints over 24 iterations in 310 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-20 18:30:11] [INFO ] Invariant cache hit.
[2023-03-20 18:30:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 18:30:11] [INFO ] Invariant cache hit.
[2023-03-20 18:30:11] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-20 18:30:11] [INFO ] Invariant cache hit.
[2023-03-20 18:30:11] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 105/105 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 18:30:12] [INFO ] Invariant cache hit.
[2023-03-20 18:30:12] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-20 18:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-20 18:30:12] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 18:30:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:30:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-20 18:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:13] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 18:30:13] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-20 18:30:13] [INFO ] Added : 101 causal constraints over 21 iterations in 265 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1571 reset in 183 ms.
Product exploration explored 100000 steps with 1558 reset in 212 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 204
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 204
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 36 place count 105 transition count 204
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 105 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 102 transition count 140
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 102 transition count 140
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 70 place count 90 transition count 128
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 82 place count 90 transition count 128
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 106 place count 66 transition count 80
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 130 place count 66 transition count 80
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 154 place count 42 transition count 56
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 178 place count 42 transition count 56
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 190 place count 42 transition count 44
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 190 rules in 19 ms. Remains 42 /105 variables (removed 63) and now considering 44/188 (removed 144) transitions.
[2023-03-20 18:30:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 42 cols
[2023-03-20 18:30:14] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-20 18:30:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/105 places, 44/188 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 42/105 places, 44/188 transitions.
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 105 cols
[2023-03-20 18:30:14] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-20 18:30:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 18:30:14] [INFO ] Invariant cache hit.
[2023-03-20 18:30:14] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-20 18:30:14] [INFO ] Invariant cache hit.
[2023-03-20 18:30:14] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 105/105 places, 188/188 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07 finished in 6582 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)||(p1&&G(p2)))))'
Support contains 104 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 150 transition count 232
Applied a total of 8 rules in 10 ms. Remains 150 /154 variables (removed 4) and now considering 232/236 (removed 4) transitions.
// Phase 1: matrix 232 rows 150 cols
[2023-03-20 18:30:14] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-20 18:30:14] [INFO ] Implicit Places using invariants in 69 ms returned [120, 121]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/154 places, 232/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 148/154 places, 232/236 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s120 s121 s122 s123)), p1:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115) (ADD s4 s5 s6 s7 s8 s9...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 2102 steps with 0 reset with depth 2103 and stack size 2103 in 8 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-10 finished in 593 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' '!(((p0||(G(p1) U p2)) U p3))'
Support contains 21 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 87 transition count 108
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 87 transition count 108
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 162 place count 75 transition count 96
Iterating global reduction 2 with 12 rules applied. Total rules applied 174 place count 75 transition count 96
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 2 with 8 rules applied. Total rules applied 182 place count 71 transition count 92
Applied a total of 182 rules in 16 ms. Remains 71 /154 variables (removed 83) and now considering 92/236 (removed 144) transitions.
// Phase 1: matrix 92 rows 71 cols
[2023-03-20 18:30:15] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-20 18:30:15] [INFO ] Implicit Places using invariants in 40 ms returned [0, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/154 places, 92/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 69/154 places, 92/236 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (LEQ 1 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51)) (LEQ 1 (ADD s53 s54 s55 s56))), p0:(LEQ 2 (ADD s53 s54 s55 s56)), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-11 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 59 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 59 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 47 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 47 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 35 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 35 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 35 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 275 place count 30 transition count 28
Applied a total of 275 rules in 13 ms. Remains 30 /154 variables (removed 124) and now considering 28/236 (removed 208) transitions.
// Phase 1: matrix 28 rows 30 cols
[2023-03-20 18:30:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-20 18:30:15] [INFO ] Implicit Places using invariants in 31 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/154 places, 28/236 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 24 transition count 24
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 2 with 8 rules applied. Total rules applied 16 place count 20 transition count 20
Applied a total of 16 rules in 2 ms. Remains 20 /28 variables (removed 8) and now considering 20/28 (removed 8) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-20 18:30:15] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-20 18:30:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 18:30:15] [INFO ] Invariant cache hit.
[2023-03-20 18:30:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/154 places, 20/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 20/154 places, 20/236 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7189 reset in 138 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 16 and stack size 16 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-15 finished in 283 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(F(p1))||G(p0)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 59 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 59 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 47 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 47 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 35 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 35 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 35 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 275 place count 30 transition count 28
Applied a total of 275 rules in 16 ms. Remains 30 /154 variables (removed 124) and now considering 28/236 (removed 208) transitions.
// Phase 1: matrix 28 rows 30 cols
[2023-03-20 18:30:16] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-20 18:30:16] [INFO ] Implicit Places using invariants in 30 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 29/154 places, 28/236 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 25 transition count 24
Applied a total of 8 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 24/28 (removed 4) transitions.
// Phase 1: matrix 24 rows 25 cols
[2023-03-20 18:30:16] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 18:30:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 18:30:16] [INFO ] Invariant cache hit.
[2023-03-20 18:30:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 25/154 places, 24/236 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 107 ms. Remains : 25/154 places, 24/236 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s8 s9 s10 s11) (ADD s17 s18 s19 s20)), p0:(GT s12 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4784 reset in 153 ms.
Product exploration explored 100000 steps with 4779 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 18:30:18] [INFO ] Invariant cache hit.
[2023-03-20 18:30:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 18:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 18:30:18] [INFO ] Computed and/alt/rep : 20/48/20 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 18:30:18] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-20 18:30:18] [INFO ] Invariant cache hit.
[2023-03-20 18:30:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 18:30:18] [INFO ] Invariant cache hit.
[2023-03-20 18:30:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-20 18:30:18] [INFO ] Invariant cache hit.
[2023-03-20 18:30:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 25/25 places, 24/24 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 18:30:19] [INFO ] Invariant cache hit.
[2023-03-20 18:30:19] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-20 18:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:30:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-20 18:30:19] [INFO ] Computed and/alt/rep : 20/48/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 18:30:19] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4639 reset in 148 ms.
Product exploration explored 100000 steps with 4740 reset in 165 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-20 18:30:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 18:30:20] [INFO ] Invariant cache hit.
[2023-03-20 18:30:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 25/25 places, 24/24 transitions.
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-20 18:30:20] [INFO ] Invariant cache hit.
[2023-03-20 18:30:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 18:30:20] [INFO ] Invariant cache hit.
[2023-03-20 18:30:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-20 18:30:20] [INFO ] Invariant cache hit.
[2023-03-20 18:30:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 25/25 places, 24/24 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07 finished in 4841 ms.
[2023-03-20 18:30:20] [INFO ] Flatten gal took : 17 ms
[2023-03-20 18:30:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 18:30:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 236 transitions and 708 arcs took 1 ms.
Total runtime 24453 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1779/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07

BK_STOP 1679337021870

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name UtilityControlRoom-COL-Z4T4N04-LTLCardinality-07
ltl formula formula --ltl=/tmp/1779/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 154 places, 236 transitions and 708 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1779/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x556c119de3f4]
1: pnml2lts-mc(+0xa2496) [0x556c119de496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8713039140]
3: pnml2lts-mc(+0x405be5) [0x556c11d41be5]
4: pnml2lts-mc(+0x164ad3) [0x556c11aa0ad3]
5: pnml2lts-mc(+0x272e0a) [0x556c11baee0a]
6: pnml2lts-mc(+0xb61f0) [0x556c119f21f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8712e8c4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8712e8c67a]
9: pnml2lts-mc(+0xa1581) [0x556c119dd581]
10: pnml2lts-mc(+0xa1910) [0x556c119dd910]
11: pnml2lts-mc(+0xa32a2) [0x556c119df2a2]
12: pnml2lts-mc(+0xa50f4) [0x556c119e10f4]
13: pnml2lts-mc(+0x3f34b3) [0x556c11d2f4b3]
14: pnml2lts-mc(+0x7c63d) [0x556c119b863d]
15: pnml2lts-mc(+0x67d86) [0x556c119a3d86]
16: pnml2lts-mc(+0x60a8a) [0x556c1199ca8a]
17: pnml2lts-mc(+0x5eb15) [0x556c1199ab15]
18: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8712e74d0a]
19: pnml2lts-mc(+0x6075e) [0x556c1199c75e]

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="UtilityControlRoom-COL-Z4T4N04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T4N04, 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 r489-tall-167912707601059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N04.tgz
mv UtilityControlRoom-COL-Z4T4N04 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 ;