Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108600541.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108600541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 488K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 132K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 526K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 7.0K May 12 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 11 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 11 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 93K May 12 08:13 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-PT-Z2T3N08-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-15

=== Now, execution of the tool begins

BK_START 1621482766063

Running Version 0
[2021-05-20 03:52:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-20 03:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 03:52:47] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-20 03:52:47] [INFO ] Transformed 140 places.
[2021-05-20 03:52:47] [INFO ] Transformed 216 transitions.
[2021-05-20 03:52:47] [INFO ] Parsed PT model containing 140 places and 216 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-20 03:52:47] [INFO ] Reduced 8 identical enabling conditions.
[2021-05-20 03:52:47] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N08-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 171
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 171
Applied a total of 26 rules in 18 ms. Remains 127 /140 variables (removed 13) and now considering 171/184 (removed 13) transitions.
// Phase 1: matrix 171 rows 127 cols
[2021-05-20 03:52:47] [INFO ] Computed 19 place invariants in 20 ms
[2021-05-20 03:52:48] [INFO ] Implicit Places using invariants in 185 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
// Phase 1: matrix 171 rows 126 cols
[2021-05-20 03:52:48] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-20 03:52:48] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Starting structural reductions, iteration 1 : 126/140 places, 171/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 171/171 (removed 0) transitions.
// Phase 1: matrix 171 rows 126 cols
[2021-05-20 03:52:48] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-20 03:52:48] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 2 iterations. Remains : 126/140 places, 171/184 transitions.
[2021-05-20 03:52:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-20 03:52:48] [INFO ] Flatten gal took : 47 ms
FORMULA UtilityControlRoom-PT-Z2T3N08-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 03:52:48] [INFO ] Flatten gal took : 17 ms
[2021-05-20 03:52:48] [INFO ] Input system was already deterministic with 171 transitions.
Finished random walk after 1070 steps, including 0 resets, run visited all 19 properties in 14 ms. (steps per millisecond=76 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(!p0)))], workingDir=/home/mcc/execution]
Support contains 19 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 165
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 120 transition count 162
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 15 place count 120 transition count 146
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 47 place count 104 transition count 146
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 73 place count 91 transition count 133
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 86 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 102 place count 83 transition count 112
Applied a total of 102 rules in 36 ms. Remains 83 /126 variables (removed 43) and now considering 112/171 (removed 59) transitions.
// Phase 1: matrix 112 rows 83 cols
[2021-05-20 03:52:48] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:48] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 112 rows 83 cols
[2021-05-20 03:52:48] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2021-05-20 03:52:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 83 cols
[2021-05-20 03:52:48] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:48] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/126 places, 112/171 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, false, (NOT p0), p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s17 1) (LT s42 1)) (OR (LT s1 1) (LT s5 1) (LT s42 1)) (OR (LT s0 1) (LT s12 1) (LT s42 1)) (OR (LT s0 1) (LT s2 1) (LT s42 1)) (OR (LT s0 1) (LT s13 1) (LT s42 1)) (OR (LT s1 1) (LT s4 1) (LT s42 1)) (OR (LT s0 1) (LT s8 1) (LT s42 1)) (OR (LT s1 1) (LT s14 1) (LT s42 1)) (OR (LT s1 1) (LT s10 1) (LT s42 1)) (OR (LT s0 1) (LT s16 1) (LT s42 1)) (OR (LT s0 1) (LT s11 1) (LT s42 1)) (OR (LT s1 1) (LT s9 1) (LT s42 1)) (OR (LT s0 1) (LT s7 1) (LT s42 1)) (OR (LT s1 1) (LT s13 1) (LT s42 1)) (OR (LT s0 1) (LT s3 1) (LT s42 1)) (OR (LT s0 1) (LT s5 1) (LT s42 1)) (OR (LT s1 1) (LT s12 1) (LT s42 1)) (OR (LT s0 1) (LT s10 1) (LT s42 1)) (OR (LT s1 1) (LT s17 1) (LT s42 1)) (OR (LT s1 1) (LT s7 1) (LT s42 1)) (OR (LT s0 1) (LT s15 1) (LT s42 1)) (OR (LT s1 1) (LT s2 1) (LT s42 1)) (OR (LT s1 1) (LT s16 1) (LT s42 1)) (OR (LT s1 1) (LT s8 1) (LT s42 1)) (OR (LT s0 1) (LT s6 1) (LT s42 1)) (OR (LT s0 1) (LT s4 1) (LT s42 1)) (OR (LT s1 1) (LT s6 1) (LT s42 1)) (OR (LT s0 1) (LT s9 1) (LT s42 1)) (OR (LT s0 1) (LT s14 1) (LT s42 1)) (OR (LT s1 1) (LT s3 1) (LT s42 1)) (OR (LT s1 1) (LT s15 1) (LT s42 1)) (OR (LT s1 1) (LT s11 1) (LT s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-00 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U (p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 35 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 7 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:49] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:49] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:49] [INFO ] Computed 18 place invariants in 22 ms
[2021-05-20 03:52:49] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:49] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:49] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s18 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s82 1))), p0:(OR (GEQ s81 1) (GEQ s80 1) (GEQ s75 1) (GEQ s74 1) (GEQ s77 1) (GEQ s76 1) (GEQ s79 1) (GEQ s78 1)), p2:(OR (GEQ s84 1) (GEQ s83 1) (GEQ s86 1) (GEQ s85 1) (GEQ s89 1) (GEQ s87 1) (GEQ s90 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], 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 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-01 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 70 place count 91 transition count 136
Applied a total of 70 rules in 15 ms. Remains 91 /126 variables (removed 35) and now considering 136/171 (removed 35) transitions.
// Phase 1: matrix 136 rows 91 cols
[2021-05-20 03:52:49] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:49] [INFO ] Implicit Places using invariants in 46 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
[2021-05-20 03:52:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 136 rows 90 cols
[2021-05-20 03:52:49] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-20 03:52:49] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 90/126 places, 136/171 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2021-05-20 03:52:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 136 rows 90 cols
[2021-05-20 03:52:49] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-20 03:52:49] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/126 places, 136/171 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10359 reset in 358 ms.
Product exploration explored 100000 steps with 10494 reset in 296 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10376 reset in 237 ms.
Product exploration explored 100000 steps with 10438 reset in 284 ms.
[2021-05-20 03:52:51] [INFO ] Flatten gal took : 10 ms
[2021-05-20 03:52:51] [INFO ] Flatten gal took : 9 ms
[2021-05-20 03:52:51] [INFO ] Time to serialize gal into /tmp/LTL6248278084120690981.gal : 5 ms
[2021-05-20 03:52:51] [INFO ] Time to serialize properties into /tmp/LTL537335736578402415.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6248278084120690981.gal, -t, CGAL, -LTL, /tmp/LTL537335736578402415.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6248278084120690981.gal -t CGAL -LTL /tmp/LTL537335736578402415.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((Assigned_3_0>=1)||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))||(Assigned_6_1>=1))||(Assigned_6_0>=1))||(Assigned_7_1>=1))||(Assigned_7_0>=1))||(Assigned_0_0>=1))||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))"))))
Formula 0 simplified : !GF"((((((((((((((((Assigned_3_0>=1)||(Assigned_3_1>=1))||(Assigned_4_0>=1))||(Assigned_4_1>=1))||(Assigned_5_0>=1))||(Assigned_5_1>=1))||(Assigned_6_1>=1))||(Assigned_6_0>=1))||(Assigned_7_1>=1))||(Assigned_7_0>=1))||(Assigned_0_0>=1))||(Assigned_0_1>=1))||(Assigned_1_0>=1))||(Assigned_1_1>=1))||(Assigned_2_0>=1))||(Assigned_2_1>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
229 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.31136,94600,1,0,51,413891,24,1,2457,275493,129
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N08-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T3N08-02 finished in 4193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0||G(F(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 27 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 6 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:53] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:53] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:53] [INFO ] Computed 18 place invariants in 9 ms
[2021-05-20 03:52:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:53] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:54] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 1)) (OR (LT s0 1) (LT s21 1) (LT s82 1)) (OR (LT s1 1) (LT s12 1) (LT s82 1)) (OR (LT s0 1) (LT s16 1) (LT s82 1)) (OR (LT s1 1) (LT s22 1) (LT s82 1)) (OR (LT s1 1) (LT s18 1) (LT s82 1)) (OR (LT s0 1) (LT s24 1) (LT s82 1)) (OR (LT s0 1) (LT s19 1) (LT s82 1)) (OR (LT s1 1) (LT s17 1) (LT s82 1)) (OR (LT s0 1) (LT s15 1) (LT s82 1)) (OR (LT s1 1) (LT s21 1) (LT s82 1)) (OR (LT s0 1) (LT s11 1) (LT s82 1)) (OR (LT s0 1) (LT s13 1) (LT s82 1)) (OR (LT s1 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s18 1) (LT s82 1)) (OR (LT s1 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s15 1) (LT s82 1)) (OR (LT s0 1) (LT s23 1) (LT s82 1)) (OR (LT s1 1) (LT s10 1) (LT s82 1)) (OR (LT s1 1) (LT s24 1) (LT s82 1)) (OR (LT s1 1) (LT s16 1) (LT s82 1)) (OR (LT s0 1) (LT s14 1) (LT s82 1)) (OR (LT s0 1) (LT s12 1) (LT s82 1)) (OR (LT s1 1) (LT s14 1) (LT s82 1)) (OR (LT s0 1) (LT s17 1) (LT s82 1)) (OR (LT s0 1) (LT s22 1) (LT s82 1)) (OR (LT s1 1) (LT s11 1) (LT s82 1)) (OR (LT s1 1) (LT s23 1) (LT s82 1)) (OR (LT s1 1) (LT s19 1) (LT s82 1))), p1:(OR (GEQ s84 1) (GEQ s83 1) (GEQ s86 1) (GEQ s85 1) (GEQ s89 1) (GEQ s87 1) (GEQ s90 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15721 reset in 303 ms.
Product exploration explored 100000 steps with 15926 reset in 345 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15756 reset in 303 ms.
Product exploration explored 100000 steps with 15677 reset in 315 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 27 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 168/168 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 123 transition count 184
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 184
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 184
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 48 place count 123 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 123 transition count 168
Deduced a syphon composed of 40 places in 1 ms
Applied a total of 56 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2021-05-20 03:52:55] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:52:55] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:52:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Product exploration explored 100000 steps with 12913 reset in 538 ms.
Product exploration explored 100000 steps with 12932 reset in 447 ms.
[2021-05-20 03:52:56] [INFO ] Flatten gal took : 10 ms
[2021-05-20 03:52:56] [INFO ] Flatten gal took : 10 ms
[2021-05-20 03:52:56] [INFO ] Time to serialize gal into /tmp/LTL3994814660512087669.gal : 2 ms
[2021-05-20 03:52:56] [INFO ] Time to serialize properties into /tmp/LTL13224720670407963669.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3994814660512087669.gal, -t, CGAL, -LTL, /tmp/LTL13224720670407963669.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3994814660512087669.gal -t CGAL -LTL /tmp/LTL13224720670407963669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G(F("((((((((Finished_1<1)&&(Finished_0<1))&&(Finished_3<1))&&(Finished_2<1))&&(Finished_6<1))&&(Finished_4<1))&&(Finished_7<1))&&(Finished_5<1))")))||("((((((((((((((((((((((((((((((((((IdleTechs_0<1)||(OpenRequests_7_1<1))||(Idles<1))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_6_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_7_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_7_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_6_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_7_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_6_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_6_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_1<1))||(Idles<1)))")))))))
Formula 0 simplified : !XXXF("((((((((((((((((((((((((((((((((((IdleTechs_0<1)||(OpenRequests_7_1<1))||(Idles<1))&&(((IdleTechs_1<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_6_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_7_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_5_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_4_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_7_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_6_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_7_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_3_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_1_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_2_0<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_3_1<1))||(Idles<1)))&&(((IdleTechs_0<1)||(OpenRequests_6_0<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_0_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_6_1<1))||(Idles<1)))&&(((IdleTechs_1<1)||(OpenRequests_4_1<1))||(Idles<1)))" | GF"((((((((Finished_1<1)&&(Finished_0<1))&&(Finished_3<1))&&(Finished_2<1))&&(Finished_6<1))&&(Finished_4<1))&&(Finished_7<1))&&(Finished_5<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-20 03:53:12] [INFO ] Flatten gal took : 9 ms
[2021-05-20 03:53:12] [INFO ] Applying decomposition
[2021-05-20 03:53:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17428117679724903156.txt, -o, /tmp/graph17428117679724903156.bin, -w, /tmp/graph17428117679724903156.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17428117679724903156.bin, -l, -1, -v, -w, /tmp/graph17428117679724903156.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:53:12] [INFO ] Decomposing Gal with order
[2021-05-20 03:53:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:53:12] [INFO ] Removed a total of 193 redundant transitions.
[2021-05-20 03:53:12] [INFO ] Flatten gal took : 42 ms
[2021-05-20 03:53:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 10 ms.
[2021-05-20 03:53:12] [INFO ] Time to serialize gal into /tmp/LTL15845653909634755334.gal : 4 ms
[2021-05-20 03:53:12] [INFO ] Time to serialize properties into /tmp/LTL5796450221877367826.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15845653909634755334.gal, -t, CGAL, -LTL, /tmp/LTL5796450221877367826.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15845653909634755334.gal -t CGAL -LTL /tmp/LTL5796450221877367826.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G(F("((((((((i3.i1.u1.Finished_1<1)&&(i2.i1.u0.Finished_0<1))&&(i7.i1.u40.Finished_3<1))&&(i5.i1.u2.Finished_2<1))&&(i1.i1.u3.Finished_6<1))&&(i6.i1.u41.Finished_4<1))&&(i4.u4.Finished_7<1))&&(i0.i1.u42.Finished_5<1))")))||("((((((((((((((((((((((((((((((((((i2.i1.u21.IdleTechs_0<1)||(i4.u7.OpenRequests_7_1<1))||(i3.i0.u18.Idles<1))&&(((i2.i0.u8.IdleTechs_1<1)||(i3.i0.u35.OpenRequests_1_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i0.i0.u38.OpenRequests_5_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i2.i1.u5.OpenRequests_0_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i0.i0.u38.OpenRequests_5_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i3.i0.u35.OpenRequests_1_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i7.i0.u36.OpenRequests_3_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i1.i0.u39.OpenRequests_6_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i6.i0.u37.OpenRequests_4_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i4.u7.OpenRequests_7_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i6.i0.u37.OpenRequests_4_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i7.i0.u36.OpenRequests_3_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i5.i0.u6.OpenRequests_2_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i0.i0.u38.OpenRequests_5_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i2.i1.u5.OpenRequests_0_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i3.i0.u35.OpenRequests_1_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i0.i0.u38.OpenRequests_5_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i6.i0.u37.OpenRequests_4_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i4.u7.OpenRequests_7_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i5.i0.u6.OpenRequests_2_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i1.i0.u39.OpenRequests_6_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i2.i1.u5.OpenRequests_0_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i4.u7.OpenRequests_7_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i7.i0.u36.OpenRequests_3_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i5.i0.u6.OpenRequests_2_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i3.i0.u35.OpenRequests_1_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i5.i0.u6.OpenRequests_2_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i7.i0.u36.OpenRequests_3_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i1.i0.u39.OpenRequests_6_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i2.i1.u5.OpenRequests_0_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i1.i0.u39.OpenRequests_6_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i6.i0.u37.OpenRequests_4_1<1))||(i3.i0.u18.Idles<1)))")))))))
Formula 0 simplified : !XXXF("((((((((((((((((((((((((((((((((((i2.i1.u21.IdleTechs_0<1)||(i4.u7.OpenRequests_7_1<1))||(i3.i0.u18.Idles<1))&&(((i2.i0.u8.IdleTechs_1<1)||(i3.i0.u35.OpenRequests_1_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i0.i0.u38.OpenRequests_5_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i2.i1.u5.OpenRequests_0_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i0.i0.u38.OpenRequests_5_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i3.i0.u35.OpenRequests_1_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i7.i0.u36.OpenRequests_3_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i1.i0.u39.OpenRequests_6_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i6.i0.u37.OpenRequests_4_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i4.u7.OpenRequests_7_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i6.i0.u37.OpenRequests_4_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i7.i0.u36.OpenRequests_3_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i5.i0.u6.OpenRequests_2_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i0.i0.u38.OpenRequests_5_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i2.i1.u5.OpenRequests_0_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i3.i0.u35.OpenRequests_1_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i0.i0.u38.OpenRequests_5_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i6.i0.u37.OpenRequests_4_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i4.u7.OpenRequests_7_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i5.i0.u6.OpenRequests_2_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i1.i0.u39.OpenRequests_6_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i2.i1.u5.OpenRequests_0_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i4.u7.OpenRequests_7_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i7.i0.u36.OpenRequests_3_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i5.i0.u6.OpenRequests_2_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i3.i0.u35.OpenRequests_1_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i5.i0.u6.OpenRequests_2_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i7.i0.u36.OpenRequests_3_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i1.u21.IdleTechs_0<1)||(i1.i0.u39.OpenRequests_6_0<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i2.i1.u5.OpenRequests_0_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i1.i0.u39.OpenRequests_6_1<1))||(i3.i0.u18.Idles<1)))&&(((i2.i0.u8.IdleTechs_1<1)||(i6.i0.u37.OpenRequests_4_1<1))||(i3.i0.u18.Idles<1)))" | GF"((((((((i3.i1.u1.Finished_1<1)&&(i2.i1.u0.Finished_0<1))&&(i7.i1.u40.Finished_3<1))&&(i5.i1.u2.Finished_2<1))&&(i1.i1.u3.Finished_6<1))&&(i6.i1.u41.Finished_4<1))&&(i4.u4.Finished_7<1))&&(i0.i1.u42.Finished_5<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
145 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.48248,64416,1,0,86134,181,1490,107922,94,537,108185
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N08-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-PT-Z2T3N08-03 finished in 20024 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 35 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
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 0 with 16 rules applied. Total rules applied 22 place count 115 transition count 160
Applied a total of 22 rules in 10 ms. Remains 115 /126 variables (removed 11) and now considering 160/171 (removed 11) transitions.
// Phase 1: matrix 160 rows 115 cols
[2021-05-20 03:53:13] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:13] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2021-05-20 03:53:13] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:13] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2021-05-20 03:53:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2021-05-20 03:53:13] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:14] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 115/126 places, 160/171 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s31 1) (LT s30 1) (LT s33 1) (LT s32 1) (LT s18 1) (LT s19 1) (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (OR (AND (GEQ s0 1) (GEQ s17 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s7 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s15 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s2 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s6 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s74 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Stack based approach found an accepted trace after 1340 steps with 0 reset with depth 1341 and stack size 1341 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-04 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 27 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 165
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 120 transition count 162
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 15 place count 120 transition count 146
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 47 place count 104 transition count 146
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 73 place count 91 transition count 133
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 86 place count 91 transition count 120
Applied a total of 86 rules in 11 ms. Remains 91 /126 variables (removed 35) and now considering 120/171 (removed 51) transitions.
// Phase 1: matrix 120 rows 91 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:14] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 120 rows 91 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-20 03:53:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2021-05-20 03:53:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 120 rows 91 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:14] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/126 places, 120/171 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p0:(OR (AND (GEQ s0 1) (GEQ s18 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s24 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s22 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s23 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s21 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-05 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 19 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 3 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:14] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-20 03:53:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:14] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-20 03:53:14] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, true, true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 1)) (OR (LT s0 1) (LT s21 1) (LT s82 1)) (OR (LT s1 1) (LT s12 1) (LT s82 1)) (OR (LT s0 1) (LT s16 1) (LT s82 1)) (OR (LT s1 1) (LT s22 1) (LT s82 1)) (OR (LT s1 1) (LT s18 1) (LT s82 1)) (OR (LT s0 1) (LT s24 1) (LT s82 1)) (OR (LT s0 1) (LT s19 1) (LT s82 1)) (OR (LT s1 1) (LT s17 1) (LT s82 1)) (OR (LT s0 1) (LT s15 1) (LT s82 1)) (OR (LT s1 1) (LT s21 1) (LT s82 1)) (OR (LT s0 1) (LT s11 1) (LT s82 1)) (OR (LT s0 1) (LT s13 1) (LT s82 1)) (OR (LT s1 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s18 1) (LT s82 1)) (OR (LT s1 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s15 1) (LT s82 1)) (OR (LT s0 1) (LT s23 1) (LT s82 1)) (OR (LT s1 1) (LT s10 1) (LT s82 1)) (OR (LT s1 1) (LT s24 1) (LT s82 1)) (OR (LT s1 1) (LT s16 1) (LT s82 1)) (OR (LT s0 1) (LT s14 1) (LT s82 1)) (OR (LT s0 1) (LT s12 1) (LT s82 1)) (OR (LT s1 1) (LT s14 1) (LT s82 1)) (OR (LT s0 1) (LT s17 1) (LT s82 1)) (OR (LT s0 1) (LT s22 1) (LT s82 1)) (OR (LT s1 1) (LT s11 1) (LT s82 1)) (OR (LT s1 1) (LT s23 1) (LT s82 1)) (OR (LT s1 1) (LT s19 1) (LT s82 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-06 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 2 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:15] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:15] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-20 03:53:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:15] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-20 03:53:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p0:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3572 reset in 181 ms.
Product exploration explored 100000 steps with 3604 reset in 266 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 3574 reset in 193 ms.
Product exploration explored 100000 steps with 3584 reset in 198 ms.
Applying partial POR strategy [true, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Support contains 8 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 168/168 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 123 transition count 184
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 184
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 56 place count 123 transition count 192
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 72 place count 123 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 122 transition count 160
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 122 transition count 160
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 98 transition count 120
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 98 transition count 120
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 138 place count 82 transition count 104
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 154 place count 82 transition count 104
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 170 place count 82 transition count 88
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 170 rules in 14 ms. Remains 82 /123 variables (removed 41) and now considering 88/168 (removed 80) transitions.
[2021-05-20 03:53:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2021-05-20 03:53:16] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/123 places, 88/168 transitions.
Product exploration explored 100000 steps with 3145 reset in 210 ms.
Stack based approach found an accepted trace after 965 steps with 28 reset with depth 20 and stack size 17 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-07 finished in 1950 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 165
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 120 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 15 place count 120 transition count 147
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 45 place count 105 transition count 147
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 135 place count 60 transition count 102
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 148 place count 60 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 59 transition count 73
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 58 transition count 73
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 158 place count 51 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 165 place count 51 transition count 59
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 172 place count 44 transition count 52
Iterating global reduction 3 with 7 rules applied. Total rules applied 179 place count 44 transition count 52
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 186 place count 44 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 37 transition count 38
Applied a total of 200 rules in 12 ms. Remains 37 /126 variables (removed 89) and now considering 38/171 (removed 133) transitions.
// Phase 1: matrix 38 rows 37 cols
[2021-05-20 03:53:16] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-20 03:53:16] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 38 rows 37 cols
[2021-05-20 03:53:16] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-20 03:53:17] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-20 03:53:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 37 cols
[2021-05-20 03:53:17] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-20 03:53:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/126 places, 38/171 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 182 steps with 0 reset with depth 183 and stack size 160 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-09 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 165
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 120 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 15 place count 120 transition count 147
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 45 place count 105 transition count 147
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 133 place count 61 transition count 103
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 145 place count 61 transition count 91
Applied a total of 145 rules in 10 ms. Remains 61 /126 variables (removed 65) and now considering 91/171 (removed 80) transitions.
// Phase 1: matrix 91 rows 61 cols
[2021-05-20 03:53:17] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:17] [INFO ] Implicit Places using invariants in 49 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
[2021-05-20 03:53:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 91 rows 60 cols
[2021-05-20 03:53:17] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-20 03:53:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 60/126 places, 91/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2021-05-20 03:53:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 91 rows 60 cols
[2021-05-20 03:53:17] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-20 03:53:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/126 places, 91/171 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1644 reset in 197 ms.
Stack based approach found an accepted trace after 1045 steps with 23 reset with depth 53 and stack size 53 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-11 finished in 388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 3 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:17] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:17] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:17] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:17] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:17] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s10 1) (GEQ s82 1)), p1:(GEQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8825 reset in 184 ms.
Product exploration explored 100000 steps with 8831 reset in 194 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8839 reset in 188 ms.
Product exploration explored 100000 steps with 8640 reset in 204 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 168/168 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 123 transition count 184
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 184
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 46 place count 123 transition count 190
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 62 place count 123 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 123 transition count 174
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 63 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 174/168 (removed -6) transitions.
[2021-05-20 03:53:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 174 rows 123 cols
[2021-05-20 03:53:18] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 174/168 transitions.
Product exploration explored 100000 steps with 9259 reset in 341 ms.
Stack based approach found an accepted trace after 6437 steps with 577 reset with depth 7 and stack size 5 in 26 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-12 finished in 1787 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p1||X((p2 U p3))))||p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 169
Applied a total of 4 rules in 2 ms. Remains 124 /126 variables (removed 2) and now considering 169/171 (removed 2) transitions.
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:19] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:19] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:19] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:19] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:19] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/126 places, 169/171 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s96 1) (GEQ s58 1)), p1:(AND (GEQ s59 1) (GEQ s100 1)), p3:(AND (GEQ s59 1) (GEQ s100 1) (GEQ s0 1) (GEQ s23 1) (GEQ s83 1)), p2:(AND (GEQ s0 1) (GEQ s23 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8794 reset in 276 ms.
Product exploration explored 100000 steps with 8791 reset in 241 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 8822 reset in 224 ms.
Product exploration explored 100000 steps with 8948 reset in 235 ms.
[2021-05-20 03:53:20] [INFO ] Flatten gal took : 9 ms
[2021-05-20 03:53:20] [INFO ] Flatten gal took : 8 ms
[2021-05-20 03:53:20] [INFO ] Time to serialize gal into /tmp/LTL2091654296682365837.gal : 2 ms
[2021-05-20 03:53:20] [INFO ] Time to serialize properties into /tmp/LTL10808132767315212517.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2091654296682365837.gal, -t, CGAL, -LTL, /tmp/LTL10808132767315212517.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2091654296682365837.gal -t CGAL -LTL /tmp/LTL10808132767315212517.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("((ClientsWaiting_4>=1)||(MovetoZ_7_1_0>=1))")||(G(("((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1))")||(X(("(((IdleTechs_0>=1)&&(OpenRequests_6_1>=1))&&(Idles>=1))")U("(((((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1))&&(IdleTechs_0>=1))&&(OpenRequests_6_1>=1))&&(Idles>=1))"))))))))
Formula 0 simplified : !F("((ClientsWaiting_4>=1)||(MovetoZ_7_1_0>=1))" | G("((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1))" | X("(((IdleTechs_0>=1)&&(OpenRequests_6_1>=1))&&(Idles>=1))" U "(((((StartSecuring_0_0>=1)&&(ClientsTimeout_0>=1))&&(IdleTechs_0>=1))&&(OpenRequests_6_1>=1))&&(Idles>=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-20 03:53:35] [INFO ] Flatten gal took : 8 ms
[2021-05-20 03:53:35] [INFO ] Applying decomposition
[2021-05-20 03:53:36] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6384173701000341765.txt, -o, /tmp/graph6384173701000341765.bin, -w, /tmp/graph6384173701000341765.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6384173701000341765.bin, -l, -1, -v, -w, /tmp/graph6384173701000341765.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 03:53:36] [INFO ] Decomposing Gal with order
[2021-05-20 03:53:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 03:53:36] [INFO ] Removed a total of 187 redundant transitions.
[2021-05-20 03:53:36] [INFO ] Flatten gal took : 18 ms
[2021-05-20 03:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 7 ms.
[2021-05-20 03:53:36] [INFO ] Time to serialize gal into /tmp/LTL10662400674817203297.gal : 3 ms
[2021-05-20 03:53:36] [INFO ] Time to serialize properties into /tmp/LTL12273362485809382580.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10662400674817203297.gal, -t, CGAL, -LTL, /tmp/LTL12273362485809382580.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10662400674817203297.gal -t CGAL -LTL /tmp/LTL12273362485809382580.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("((i1.i0.u43.ClientsWaiting_4>=1)||(i3.i1.u29.MovetoZ_7_1_0>=1))")||(G(("((i7.i0.u21.StartSecuring_0_0>=1)&&(i7.i0.u39.ClientsTimeout_0>=1))")||(X(("(((i7.i1.u8.IdleTechs_0>=1)&&(i6.i0.u35.OpenRequests_6_1>=1))&&(i5.i0.u16.Idles>=1))")U("(((((i7.i0.u21.StartSecuring_0_0>=1)&&(i7.i0.u39.ClientsTimeout_0>=1))&&(i7.i1.u8.IdleTechs_0>=1))&&(i6.i0.u35.OpenRequests_6_1>=1))&&(i5.i0.u16.Idles>=1))"))))))))
Formula 0 simplified : !F("((i1.i0.u43.ClientsWaiting_4>=1)||(i3.i1.u29.MovetoZ_7_1_0>=1))" | G("((i7.i0.u21.StartSecuring_0_0>=1)&&(i7.i0.u39.ClientsTimeout_0>=1))" | X("(((i7.i1.u8.IdleTechs_0>=1)&&(i6.i0.u35.OpenRequests_6_1>=1))&&(i5.i0.u16.Idles>=1))" U "(((((i7.i0.u21.StartSecuring_0_0>=1)&&(i7.i0.u39.ClientsTimeout_0>=1))&&(i7.i1.u8.IdleTechs_0>=1))&&(i6.i0.u35.OpenRequests_6_1>=1))&&(i5.i0.u16.Idles>=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.124704,21064,1,0,7796,264,1785,15026,145,699,16847
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N08-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T3N08-13 finished in 16799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 169
Applied a total of 4 rules in 2 ms. Remains 124 /126 variables (removed 2) and now considering 169/171 (removed 2) transitions.
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:36] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:36] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:36] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 124 cols
[2021-05-20 03:53:36] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/126 places, 169/171 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s45 1), p0:(OR (LT s1 1) (LT s19 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24757 reset in 171 ms.
Product exploration explored 100000 steps with 24772 reset in 184 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 24853 reset in 171 ms.
Product exploration explored 100000 steps with 24856 reset in 191 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 124/124 places, 169/169 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 124 transition count 168
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 2 place count 124 transition count 184
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 124 transition count 184
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 124 transition count 191
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 63 place count 124 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 124 transition count 176
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 64 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 176/169 (removed -7) transitions.
[2021-05-20 03:53:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 124 cols
[2021-05-20 03:53:37] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:37] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 176/169 transitions.
Product exploration explored 100000 steps with 24447 reset in 426 ms.
Stack based approach found an accepted trace after 19914 steps with 4853 reset with depth 5 and stack size 4 in 90 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-14 finished in 1961 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0)) U (F(p1) U p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 171/171 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 168
Applied a total of 6 rules in 2 ms. Remains 123 /126 variables (removed 3) and now considering 168/171 (removed 3) transitions.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:38] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:38] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:38] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-20 03:53:38] [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.
// Phase 1: matrix 168 rows 123 cols
[2021-05-20 03:53:38] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-20 03:53:38] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/126 places, 168/171 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s33 1), p1:(AND (GEQ s1 1) (GEQ s11 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 832 reset in 180 ms.
Stack based approach found an accepted trace after 22270 steps with 155 reset with depth 234 and stack size 234 in 41 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-15 finished in 573 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621482819776

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-PT-Z2T3N08"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T3N08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132108600541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N08.tgz
mv UtilityControlRoom-PT-Z2T3N08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;