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.r102-smll-162075331300220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0010N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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 GPPP-PT-C0010N0000000100-00
FORMULA_NAME GPPP-PT-C0010N0000000100-01
FORMULA_NAME GPPP-PT-C0010N0000000100-02
FORMULA_NAME GPPP-PT-C0010N0000000100-03
FORMULA_NAME GPPP-PT-C0010N0000000100-04
FORMULA_NAME GPPP-PT-C0010N0000000100-05
FORMULA_NAME GPPP-PT-C0010N0000000100-06
FORMULA_NAME GPPP-PT-C0010N0000000100-07
FORMULA_NAME GPPP-PT-C0010N0000000100-08
FORMULA_NAME GPPP-PT-C0010N0000000100-09
FORMULA_NAME GPPP-PT-C0010N0000000100-10
FORMULA_NAME GPPP-PT-C0010N0000000100-11
FORMULA_NAME GPPP-PT-C0010N0000000100-12
FORMULA_NAME GPPP-PT-C0010N0000000100-13
FORMULA_NAME GPPP-PT-C0010N0000000100-14
FORMULA_NAME GPPP-PT-C0010N0000000100-15

=== Now, execution of the tool begins

BK_START 1621212190067

Running Version 0
[2021-05-17 00:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 00:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:43:13] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-17 00:43:13] [INFO ] Transformed 33 places.
[2021-05-17 00:43:13] [INFO ] Transformed 22 transitions.
[2021-05-17 00:43:13] [INFO ] Parsed PT model containing 33 places and 22 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 00:43:14] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0010N0000000100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 18 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 00:43:14] [INFO ] Computed 12 place invariants in 12 ms
[2021-05-17 00:43:14] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 00:43:14] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-17 00:43:14] [INFO ] Implicit Places using invariants in 77 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:14] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 00:43:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:14] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 00:43:14] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 00:43:15] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 00:43:15] [INFO ] Flatten gal took : 54 ms
FORMULA GPPP-PT-C0010N0000000100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 00:43:15] [INFO ] Flatten gal took : 13 ms
[2021-05-17 00:43:15] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100021 steps, including 243 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 17) seen :15
Running SMT prover for 2 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:15] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 00:43:15] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-17 00:43:15] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned unsat
[2021-05-17 00:43:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 00:43:15] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-17 00:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:43:15] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-17 00:43:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0010N0000000100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:15] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 00:43:15] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:15] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-17 00:43:15] [INFO ] Implicit Places using invariants in 68 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 80 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:15] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 00:43:15] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s2), p0:(GT 1 s20)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 266 reset in 483 ms.
Stack based approach found an accepted trace after 811 steps with 2 reset with depth 60 and stack size 60 in 7 ms.
FORMULA GPPP-PT-C0010N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-00 finished in 1303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:17] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-17 00:43:17] [INFO ] Implicit Places using invariants in 61 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GT 2 s0) (GT s24 s0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-01 finished in 499 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
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 20 place count 20 transition count 13
Applied a total of 20 rules in 50 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 00:43:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 00:43:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Implicit Places using invariants in 43 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-17 00:43:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 00:43:17] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 19/32 places, 13/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 12
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 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 11
Applied a total of 4 rules in 8 ms. Remains 17 /19 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 17 cols
[2021-05-17 00:43:17] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 11 rows 17 cols
[2021-05-17 00:43:17] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 00:43:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 00:43:17] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 108 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 15/32 places, 11/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 00:43:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-17 00:43:17] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 00:43:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 3 iterations. Remains : 15/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-03 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:(GT 3 s0)], 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 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-03 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:17] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:18] [INFO ] Implicit Places using invariants in 50 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:18] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:18] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 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 29 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 2 place count 29 transition count 23
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 29 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 26 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 26 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 26 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 25 transition count 19
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 25 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 25 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 21 ms. Remains 25 /29 variables (removed 4) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 25 cols
[2021-05-17 00:43:19] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:19] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
[2021-05-17 00:43:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 25 cols
[2021-05-17 00:43:19] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:19] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/29 places, 19/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 665 ms.
Product exploration explored 100000 steps with 50000 reset in 343 ms.
[2021-05-17 00:43:20] [INFO ] Flatten gal took : 5 ms
[2021-05-17 00:43:20] [INFO ] Flatten gal took : 4 ms
[2021-05-17 00:43:20] [INFO ] Time to serialize gal into /tmp/LTL12785456918285255121.gal : 2 ms
[2021-05-17 00:43:20] [INFO ] Time to serialize properties into /tmp/LTL15886103839423794978.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/LTL12785456918285255121.gal, -t, CGAL, -LTL, /tmp/LTL15886103839423794978.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/LTL12785456918285255121.gal -t CGAL -LTL /tmp/LTL15886103839423794978.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Ru5P<=GAP)"))))
Formula 0 simplified : !XF"(Ru5P<=GAP)"
Detected timeout of ITS tools.
[2021-05-17 00:43:35] [INFO ] Flatten gal took : 4 ms
[2021-05-17 00:43:35] [INFO ] Applying decomposition
[2021-05-17 00:43:35] [INFO ] Flatten gal took : 3 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/graph14934848060888327171.txt, -o, /tmp/graph14934848060888327171.bin, -w, /tmp/graph14934848060888327171.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/graph14934848060888327171.bin, -l, -1, -v, -w, /tmp/graph14934848060888327171.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:43:35] [INFO ] Decomposing Gal with order
[2021-05-17 00:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:43:35] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-17 00:43:35] [INFO ] Flatten gal took : 50 ms
[2021-05-17 00:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2021-05-17 00:43:36] [INFO ] Time to serialize gal into /tmp/LTL10596881215920386363.gal : 4 ms
[2021-05-17 00:43:36] [INFO ] Time to serialize properties into /tmp/LTL17192906408324146263.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/LTL10596881215920386363.gal, -t, CGAL, -LTL, /tmp/LTL17192906408324146263.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/LTL10596881215920386363.gal -t CGAL -LTL /tmp/LTL17192906408324146263.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu2.Ru5P<=gu2.GAP)"))))
Formula 0 simplified : !XF"(gu2.Ru5P<=gu2.GAP)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3521681443934801075
[2021-05-17 00:43:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3521681443934801075
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3521681443934801075]
Compilation finished in 359 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3521681443934801075]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3521681443934801075]
LTSmin run took 546 ms.
FORMULA GPPP-PT-C0010N0000000100-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000100-06 finished in 34096 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 15 place count 23 transition count 15
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 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 19 transition count 13
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 3 with 2 rules applied. Total rules applied 23 place count 18 transition count 12
Applied a total of 23 rules in 7 ms. Remains 18 /32 variables (removed 14) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 00:43:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 00:43:52] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants in 33 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
[2021-05-17 00:43:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 17/32 places, 12/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 11
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 16 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 15/32 places, 11/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 00:43:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-17 00:43:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 3 iterations. Remains : 15/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-07 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 (LEQ 2 s11) (LEQ 2 s5))], 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 6 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-07 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 28 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 10 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 12 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 00:43:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 00:43:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants in 44 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
[2021-05-17 00:43:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 16/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 15
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 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Applied a total of 4 rules in 6 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-17 00:43:52] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 00:43:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 00:43:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT s0 s11), p0:(GT s13 s8)], 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
[2021-05-17 00:43:53] [INFO ] Flatten gal took : 3 ms
[2021-05-17 00:43:53] [INFO ] Flatten gal took : 2 ms
[2021-05-17 00:43:53] [INFO ] Time to serialize gal into /tmp/LTL4135467164513628590.gal : 1 ms
[2021-05-17 00:43:53] [INFO ] Time to serialize properties into /tmp/LTL16621759301234318655.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/LTL4135467164513628590.gal, -t, CGAL, -LTL, /tmp/LTL16621759301234318655.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/LTL4135467164513628590.gal -t CGAL -LTL /tmp/LTL16621759301234318655.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(b1>_3PG)"))&&(F("(Pi>Lac)"))))
Formula 0 simplified : !(F"(b1>_3PG)" & F"(Pi>Lac)")
Reverse transition relation is NOT exact ! Due to transitions t13.t4.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/12/1/14
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
44 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.46245,22872,1,0,32,32064,61,18,939,27844,44
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0010N0000000100-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPPP-PT-C0010N0000000100-09 finished in 1579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Implicit Places using invariants in 42 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 1 s22), p1:(LEQ s19 s9)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-11 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:54] [INFO ] Implicit Places using invariants in 41 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 00:43:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 00:43:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C0010N0000000100-12 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 3 s24), p1:(GT s13 s1)], 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 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-12 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:54] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-17 00:43:54] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:54] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s26 s25), p0:(LEQ s16 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 6 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 25 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 25 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 13 rules in 8 ms. Remains 25 /29 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-17 00:43:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:55] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
[2021-05-17 00:43:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-17 00:43:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:43:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/29 places, 18/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
[2021-05-17 00:43:56] [INFO ] Flatten gal took : 3 ms
[2021-05-17 00:43:56] [INFO ] Flatten gal took : 2 ms
[2021-05-17 00:43:56] [INFO ] Time to serialize gal into /tmp/LTL4243625216358116560.gal : 1 ms
[2021-05-17 00:43:56] [INFO ] Time to serialize properties into /tmp/LTL3709930054470463690.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/LTL4243625216358116560.gal, -t, CGAL, -LTL, /tmp/LTL3709930054470463690.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/LTL4243625216358116560.gal -t CGAL -LTL /tmp/LTL3709930054470463690.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(_3PG<=Gluc)")||(G("(a2>a1)"))))))
Formula 0 simplified : !XF("(_3PG<=Gluc)" | G"(a2>a1)")
Detected timeout of ITS tools.
[2021-05-17 00:44:11] [INFO ] Flatten gal took : 5 ms
[2021-05-17 00:44:11] [INFO ] Applying decomposition
[2021-05-17 00:44:11] [INFO ] Flatten gal took : 2 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/graph13047452979552202962.txt, -o, /tmp/graph13047452979552202962.bin, -w, /tmp/graph13047452979552202962.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/graph13047452979552202962.bin, -l, -1, -v, -w, /tmp/graph13047452979552202962.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:44:11] [INFO ] Decomposing Gal with order
[2021-05-17 00:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:44:11] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 00:44:11] [INFO ] Flatten gal took : 9 ms
[2021-05-17 00:44:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 00:44:11] [INFO ] Time to serialize gal into /tmp/LTL8653842950284166383.gal : 3 ms
[2021-05-17 00:44:11] [INFO ] Time to serialize properties into /tmp/LTL3004261178709164750.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/LTL8653842950284166383.gal, -t, CGAL, -LTL, /tmp/LTL3004261178709164750.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/LTL8653842950284166383.gal -t CGAL -LTL /tmp/LTL3004261178709164750.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu4._3PG<=gu4.Gluc)")||(G("(gu8.a2>gu8.a1)"))))))
Formula 0 simplified : !XF("(gu4._3PG<=gu4.Gluc)" | G"(gu8.a2>gu8.a1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10624509391942267408
[2021-05-17 00:44:26] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10624509391942267408
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10624509391942267408]
Compilation finished in 351 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10624509391942267408]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10624509391942267408]
LTSmin run took 158 ms.
FORMULA GPPP-PT-C0010N0000000100-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000100-14 finished in 32585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:44:27] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:44:27] [INFO ] Implicit Places using invariants in 60 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:44:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:44:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:44:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:44:27] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0010N0000000100-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-15 finished in 340 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621212268691

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="GPPP-PT-C0010N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0010N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331300220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;