Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679101800158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RobotManipulation-PT-10000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101800158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 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 RobotManipulation-PT-10000-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-10000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716859040704

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-10000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 01:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 01:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:17:22] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2024-05-28 01:17:22] [INFO ] Transformed 15 places.
[2024-05-28 01:17:22] [INFO ] Transformed 11 transitions.
[2024-05-28 01:17:22] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-10000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 15 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:17:22] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 01:17:22] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 01:17:22] [INFO ] Invariant cache hit.
[2024-05-28 01:17:22] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-28 01:17:22] [INFO ] Invariant cache hit.
[2024-05-28 01:17:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 14/15 places, 11/11 transitions.
Support contains 12 out of 14 places after structural reductions.
[2024-05-28 01:17:22] [INFO ] Flatten gal took : 14 ms
[2024-05-28 01:17:22] [INFO ] Flatten gal took : 3 ms
[2024-05-28 01:17:22] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 20002 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=1176 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :10
Running SMT prover for 1 properties.
[2024-05-28 01:17:23] [INFO ] Invariant cache hit.
[2024-05-28 01:17:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-28 01:17:23] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 01:17:23] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 01:17:23] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 100001 steps, including 0 resets, run visited all 1 properties in 188 ms. (steps per millisecond=531 )
Parikh walk visited 1 properties in 188 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:17:23] [INFO ] Invariant cache hit.
[2024-05-28 01:17:23] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 12/14 places, 11/11 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:17:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:17:25] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-28 01:17:25] [INFO ] After 47ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 01:17:25] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 20001 steps, including 0 resets, run visited all 2 properties in 91 ms. (steps per millisecond=219 )
Parikh walk visited 2 properties in 90 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-28 01:17:25] [INFO ] Invariant cache hit.
[2024-05-28 01:17:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-00 finished in 2466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0||X(p1))) U (G(F((!p0||X(p1))))||(F((!p0||X(p1)))&&p2))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:17:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:17:26] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s11 1)), p0:(AND (GEQ s10 1) (GEQ s11 1)), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 19932 reset in 223 ms.
Product exploration explored 100000 steps with 19980 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))))]
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (F p2), (F (AND p0 (NOT p1))), (F (OR (AND p0 p2) (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:17:27] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:17:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 01:17:27] [INFO ] Invariant cache hit.
[2024-05-28 01:17:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-28 01:17:27] [INFO ] Invariant cache hit.
[2024-05-28 01:17:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 12/12 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Finished Best-First random walk after 56 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (F p2), (F (AND p0 (NOT p1))), (F (OR (AND p0 p2) (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 440 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19976 reset in 69 ms.
Product exploration explored 100000 steps with 19996 reset in 72 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 11 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 10 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 10 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 7 ms. Remains 10 /12 variables (removed 2) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:17:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2024-05-28 01:17:29] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:17:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 11/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 10/12 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin17950214450473305629
[2024-05-28 01:17:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17950214450473305629
Running compilation step : cd /tmp/ltsmin17950214450473305629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin17950214450473305629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17950214450473305629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6815211393732038159.hoa' '--buchi-type=spotba'
LTSmin run took 8228 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-LTLFireability-01 finished in 11575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 11 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:17:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:37] [INFO ] Implicit Places using invariants in 26 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 4
Applied a total of 6 rules in 3 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:17:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:17:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 01:17:37] [INFO ] Invariant cache hit.
[2024-05-28 01:17:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/14 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 4/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 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 3242 reset in 89 ms.
Stack based approach found an accepted trace after 97 steps with 18 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-02 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:17:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-03 finished in 145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 7 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:17:38] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants in 25 ms returned [4, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/14 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 4 transition count 4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 2 transition count 2
Applied a total of 9 rules in 5 ms. Remains 2 /6 variables (removed 4) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-28 01:17:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 01:17:38] [INFO ] Invariant cache hit.
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 2/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 2/14 places, 2/11 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 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 636 reset in 39 ms.
Product exploration explored 100000 steps with 149 reset in 40 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 1199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:17:39] [INFO ] Invariant cache hit.
[2024-05-28 01:17:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 01:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-28 01:17:40] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 01:17:40] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-28 01:17:40] [INFO ] Invariant cache hit.
[2024-05-28 01:17:40] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 01:17:40] [INFO ] Invariant cache hit.
[2024-05-28 01:17:40] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 01:17:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:17:40] [INFO ] Invariant cache hit.
[2024-05-28 01:17:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-28 01:17:40] [INFO ] Invariant cache hit.
[2024-05-28 01:17:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-28 01:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-28 01:17:40] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 01:17:40] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 302 reset in 35 ms.
Product exploration explored 100000 steps with 128 reset in 35 ms.
Built C files in :
/tmp/ltsmin11753690279940759089
[2024-05-28 01:17:40] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-28 01:17:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:40] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-28 01:17:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:40] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-28 01:17:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11753690279940759089
Running compilation step : cd /tmp/ltsmin11753690279940759089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin11753690279940759089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11753690279940759089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17738383833714563927.hoa' '--buchi-type=spotba'
LTSmin run took 526 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-LTLFireability-04 finished in 3377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!p0)) U p1) U G(!p2)))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 9
Applied a total of 5 rules in 3 ms. Remains 11 /14 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-28 01:17:41] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants in 31 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/14 places, 9/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 9 transition count 8
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-28 01:17:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:17:41] [INFO ] Invariant cache hit.
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/14 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 9/14 places, 8/11 transitions.
Stuttering acceptance computed with spot in 211 ms :[p2, p0, p0, (NOT p1), (AND p0 p2 p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s0 1) (LT s4 1)), p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 9154 reset in 68 ms.
Stack based approach found an accepted trace after 86 steps with 9 reset with depth 26 and stack size 26 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-05 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 4 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:17:41] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants in 34 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/14 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 7 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-28 01:17:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:17:41] [INFO ] Invariant cache hit.
[2024-05-28 01:17:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/14 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 3/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-06 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||G(!p0))))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:17:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5754 reset in 96 ms.
Stack based approach found an accepted trace after 180 steps with 11 reset with depth 146 and stack size 146 in 2 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-07 finished in 281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 4 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:17:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants in 30 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:17:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 01:17:42] [INFO ] Invariant cache hit.
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/14 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 5/14 places, 5/11 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s3 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 66 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-08 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0))&&F(!p1))||X(X(G(!p0)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:17:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants in 36 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:17:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 01:17:42] [INFO ] Invariant cache hit.
[2024-05-28 01:17:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 247 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), true, p1]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s4 1)), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39976 reset in 51 ms.
Product exploration explored 100000 steps with 40032 reset in 50 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-09 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U !p1)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:17:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:17:43] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 133 ms :[p1, p1, true, p0]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s6 1) (LT s9 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-11 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))&&(!p0||X(F(!p1))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:17:43] [INFO ] Invariant cache hit.
[2024-05-28 01:17:43] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 01:17:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:17:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 01:17:43] [INFO ] Invariant cache hit.
[2024-05-28 01:17:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/14 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 1117 ms :[p0, p0, p0, p1]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(LT s7 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24704 reset in 87 ms.
Stack based approach found an accepted trace after 1794 steps with 432 reset with depth 8 and stack size 8 in 2 ms.
FORMULA RobotManipulation-PT-10000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-12 finished in 1303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:17:44] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:44] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15102 reset in 76 ms.
Product exploration explored 100000 steps with 15149 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2857 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 30 ms :[p0]
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:17:45] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:17:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 01:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 01:17:45] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:17:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:17:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-28 01:17:45] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-28 01:17:45] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 8
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 8 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 8 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 4 transition count 4
Applied a total of 15 rules in 8 ms. Remains 4 /12 variables (removed 8) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:17:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:17:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 01:17:45] [INFO ] Invariant cache hit.
[2024-05-28 01:17:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 01:17:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:17:45] [INFO ] Invariant cache hit.
[2024-05-28 01:17:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 4/12 places, 4/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-13 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(!p0)&&X((!p1 U (G(!p1)||(X(p1)&&p2)))))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:17:45] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:17:45] [INFO ] Implicit Places using invariants in 28 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (OR p0 (AND p1 (NOT p2))), (OR (NOT p1) p0), (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), p0, p0, (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (AND (NOT p2) p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1)), p2:(AND (LT s5 1) (NOT (OR (LT s0 1) (LT s4 1)))), p1:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, 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 RobotManipulation-PT-10000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLFireability-14 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 13 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:17:45] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:17:45] [INFO ] Implicit Places using invariants in 226 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 227 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/14 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 4
Applied a total of 6 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:17:45] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:17:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 01:17:45] [INFO ] Invariant cache hit.
[2024-05-28 01:17:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/14 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 288 ms. Remains : 4/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-10000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 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 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLFireability-15 finished in 457 ms.
All properties solved by simple procedures.
Total runtime 24020 ms.

BK_STOP 1716859068162

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-10000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RobotManipulation-PT-10000, 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 r351-tall-171679101800158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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