About the Execution of ITS-Tools for StigmergyCommit-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1497.436 | 38118.00 | 106421.00 | 306.50 | TFFFFTFTTFFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872500155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 StigmergyCommit-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K May 30 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 7.4K May 30 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 30 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 30 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 12:20 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 StigmergyCommit-PT-06a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654782094893
Running Version 202205111006
[2022-06-09 13:41:37] [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]
[2022-06-09 13:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:41:38] [INFO ] Load time of PNML (sax parser for PT used): 737 ms
[2022-06-09 13:41:38] [INFO ] Transformed 256 places.
[2022-06-09 13:41:38] [INFO ] Transformed 2816 transitions.
[2022-06-09 13:41:38] [INFO ] Found NUPN structural information;
[2022-06-09 13:41:38] [INFO ] Parsed PT model containing 256 places and 2816 transitions in 1128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 205 transition count 530
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 205 transition count 530
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 205 transition count 524
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 131 place count 182 transition count 495
Iterating global reduction 1 with 23 rules applied. Total rules applied 154 place count 182 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 158 place count 182 transition count 491
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 179 transition count 488
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 179 transition count 488
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 166 place count 177 transition count 486
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 177 transition count 486
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 176 transition count 485
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 176 transition count 485
Applied a total of 170 rules in 96 ms. Remains 176 /256 variables (removed 80) and now considering 485/587 (removed 102) transitions.
[2022-06-09 13:41:38] [INFO ] Flow matrix only has 476 transitions (discarded 9 similar events)
// Phase 1: matrix 476 rows 176 cols
[2022-06-09 13:41:38] [INFO ] Computed 2 place invariants in 33 ms
[2022-06-09 13:41:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2022-06-09 13:41:39] [INFO ] Flow matrix only has 476 transitions (discarded 9 similar events)
// Phase 1: matrix 476 rows 176 cols
[2022-06-09 13:41:39] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 13:41:39] [INFO ] State equation strengthened by 333 read => feed constraints.
[2022-06-09 13:41:40] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 175/256 places, 485/587 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 156 transition count 466
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 156 transition count 466
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 45 place count 156 transition count 459
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 149 transition count 452
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 149 transition count 452
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 142 transition count 445
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 142 transition count 445
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 136 transition count 439
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 136 transition count 439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 131 transition count 434
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 131 transition count 434
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 126 transition count 429
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 126 transition count 429
Applied a total of 105 rules in 33 ms. Remains 126 /175 variables (removed 49) and now considering 429/485 (removed 56) transitions.
[2022-06-09 13:41:40] [INFO ] Flow matrix only has 420 transitions (discarded 9 similar events)
// Phase 1: matrix 420 rows 126 cols
[2022-06-09 13:41:40] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 13:41:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-06-09 13:41:41] [INFO ] Flow matrix only has 420 transitions (discarded 9 similar events)
// Phase 1: matrix 420 rows 126 cols
[2022-06-09 13:41:41] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 13:41:41] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:41] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/256 places, 429/587 transitions.
Finished structural reductions, in 2 iterations. Remains : 126/256 places, 429/587 transitions.
Support contains 20 out of 126 places after structural reductions.
[2022-06-09 13:41:41] [INFO ] Flatten gal took : 101 ms
[2022-06-09 13:41:41] [INFO ] Flatten gal took : 65 ms
[2022-06-09 13:41:42] [INFO ] Input system was already deterministic with 429 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 926 ms. (steps per millisecond=10 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-09 13:41:43] [INFO ] Flow matrix only has 420 transitions (discarded 9 similar events)
// Phase 1: matrix 420 rows 126 cols
[2022-06-09 13:41:43] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 13:41:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 13:41:43] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 13:41:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 13:41:43] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 13:41:43] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:43] [INFO ] After 221ms SMT Verify possible using 260 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 6 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 3 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2022-06-09 13:41:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 656 ms
[2022-06-09 13:41:45] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-06-09 13:41:45] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2022-06-09 13:41:45] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2022-06-09 13:41:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2022-06-09 13:41:45] [INFO ] After 1755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-06-09 13:41:45] [INFO ] After 2360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 429/429 transitions.
Graph (complete) has 311 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 125 transition count 363
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 76 transition count 345
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 141 place count 68 transition count 345
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 149 place count 60 transition count 337
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 60 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 60 transition count 336
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 164 place count 54 transition count 330
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 54 transition count 330
Performed 28 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 226 place count 26 transition count 55
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 250 place count 26 transition count 31
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 253 place count 26 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 26 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 255 place count 25 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 25 transition count 27
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 257 place count 25 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 259 place count 23 transition count 25
Applied a total of 259 rules in 133 ms. Remains 23 /126 variables (removed 103) and now considering 25/429 (removed 404) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/126 places, 25/429 transitions.
Finished random walk after 71 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=14 )
FORMULA StigmergyCommit-PT-06a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 7 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(p0)))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 115 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 115 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 115 transition count 416
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 108 transition count 409
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 108 transition count 409
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 108 transition count 406
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 104 transition count 402
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 104 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 104 transition count 401
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 102 transition count 399
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 102 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 102 transition count 398
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 101 transition count 397
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 101 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 101 transition count 396
Applied a total of 58 rules in 41 ms. Remains 101 /126 variables (removed 25) and now considering 396/429 (removed 33) transitions.
[2022-06-09 13:41:46] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
// Phase 1: matrix 387 rows 101 cols
[2022-06-09 13:41:46] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2022-06-09 13:41:46] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
// Phase 1: matrix 387 rows 101 cols
[2022-06-09 13:41:46] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:46] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:46] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2022-06-09 13:41:46] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
// Phase 1: matrix 387 rows 101 cols
[2022-06-09 13:41:46] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:46] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/126 places, 396/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/126 places, 396/429 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s38 0) (EQ s88 1)) (AND (EQ s32 0) (EQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-01 finished in 1188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(G(p0))))||F(!(X(G(p1)) U G(p2)))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 116 transition count 419
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 116 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 116 transition count 418
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 108 transition count 410
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 108 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 108 transition count 406
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 104 transition count 402
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 104 transition count 402
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 101 transition count 399
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 101 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 101 transition count 398
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 99 transition count 396
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 99 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 99 transition count 394
Applied a total of 62 rules in 24 ms. Remains 99 /126 variables (removed 27) and now considering 394/429 (removed 35) transitions.
[2022-06-09 13:41:47] [INFO ] Flow matrix only has 385 transitions (discarded 9 similar events)
// Phase 1: matrix 385 rows 99 cols
[2022-06-09 13:41:47] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:47] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-06-09 13:41:47] [INFO ] Flow matrix only has 385 transitions (discarded 9 similar events)
// Phase 1: matrix 385 rows 99 cols
[2022-06-09 13:41:47] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 13:41:47] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:47] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2022-06-09 13:41:47] [INFO ] Flow matrix only has 385 transitions (discarded 9 similar events)
// Phase 1: matrix 385 rows 99 cols
[2022-06-09 13:41:47] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 13:41:48] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/126 places, 394/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/126 places, 394/429 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p2 (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s27 0) (EQ s36 1)), p0:(AND (EQ s53 0) (EQ s12 1)), p1:(OR (EQ s12 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-02 finished in 1278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 125 transition count 379
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 103 place count 76 transition count 374
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 103 place count 76 transition count 366
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 119 place count 68 transition count 366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 67 transition count 364
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 67 transition count 364
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 66 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 66 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 66 transition count 361
Performed 31 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 186 place count 35 transition count 318
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 3 with 133 rules applied. Total rules applied 319 place count 35 transition count 185
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 329 place count 30 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 334 place count 30 transition count 175
Drop transitions removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 5 with 134 rules applied. Total rules applied 468 place count 30 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 482 place count 23 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 484 place count 21 transition count 32
Applied a total of 484 rules in 102 ms. Remains 21 /126 variables (removed 105) and now considering 32/429 (removed 397) transitions.
[2022-06-09 13:41:48] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-06-09 13:41:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 13:41:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-06-09 13:41:48] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-06-09 13:41:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 13:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-09 13:41:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-06-09 13:41:48] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 13:41:48] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-06-09 13:41:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 13:41:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/126 places, 32/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/126 places, 32/429 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-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:(AND (EQ s4 0) (EQ s8 1) (OR (EQ s10 0) (EQ s10 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 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-04 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(X(X(p0))))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 113 transition count 415
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 113 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 113 transition count 413
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 104 transition count 403
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 104 transition count 403
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 104 transition count 399
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 99 transition count 394
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 99 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 99 transition count 393
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 97 transition count 391
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 97 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 97 transition count 390
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 96 transition count 389
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 96 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 96 transition count 388
Applied a total of 69 rules in 24 ms. Remains 96 /126 variables (removed 30) and now considering 388/429 (removed 41) transitions.
[2022-06-09 13:41:48] [INFO ] Flow matrix only has 380 transitions (discarded 8 similar events)
// Phase 1: matrix 380 rows 96 cols
[2022-06-09 13:41:48] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-06-09 13:41:48] [INFO ] Flow matrix only has 380 transitions (discarded 8 similar events)
// Phase 1: matrix 380 rows 96 cols
[2022-06-09 13:41:48] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:49] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:49] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2022-06-09 13:41:49] [INFO ] Flow matrix only has 380 transitions (discarded 8 similar events)
// Phase 1: matrix 380 rows 96 cols
[2022-06-09 13:41:49] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:49] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/126 places, 388/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/126 places, 388/429 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s60 0) (EQ s84 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 566 ms.
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-05 finished in 1946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 113 transition count 415
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 113 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 113 transition count 413
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 104 transition count 403
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 104 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 104 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 97 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 97 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 97 transition count 393
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 93 transition count 389
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 93 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 93 transition count 387
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 91 transition count 385
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 91 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 91 transition count 383
Applied a total of 79 rules in 34 ms. Remains 91 /126 variables (removed 35) and now considering 383/429 (removed 46) transitions.
[2022-06-09 13:41:50] [INFO ] Flow matrix only has 375 transitions (discarded 8 similar events)
// Phase 1: matrix 375 rows 91 cols
[2022-06-09 13:41:50] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 13:41:50] [INFO ] Implicit Places using invariants in 112 ms returned []
[2022-06-09 13:41:50] [INFO ] Flow matrix only has 375 transitions (discarded 8 similar events)
// Phase 1: matrix 375 rows 91 cols
[2022-06-09 13:41:50] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:51] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:51] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2022-06-09 13:41:51] [INFO ] Flow matrix only has 375 transitions (discarded 8 similar events)
// Phase 1: matrix 375 rows 91 cols
[2022-06-09 13:41:51] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 13:41:51] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/126 places, 383/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/126 places, 383/429 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s6 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 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-11 finished in 1634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X((!p0 U p1)))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 429/429 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 114 transition count 416
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 114 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 114 transition count 415
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 104 transition count 404
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 104 transition count 404
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 104 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 99 transition count 395
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 99 transition count 395
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 95 transition count 391
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 95 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 95 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 94 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 94 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 94 transition count 387
Applied a total of 72 rules in 17 ms. Remains 94 /126 variables (removed 32) and now considering 387/429 (removed 42) transitions.
[2022-06-09 13:41:52] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:52] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:52] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-06-09 13:41:52] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:52] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:52] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2022-06-09 13:41:52] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:52] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:53] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/126 places, 387/429 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/126 places, 387/429 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s48 0) (EQ s76 1)), p0:(OR (EQ s52 0) (EQ s12 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 371 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 355 ms. (steps per millisecond=28 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-09 13:41:54] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:54] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:54] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 13:41:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 13:41:54] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 387/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2022-06-09 13:41:55] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:55] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 13:41:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-06-09 13:41:55] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:55] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 13:41:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2022-06-09 13:41:55] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-06-09 13:41:55] [INFO ] Flow matrix only has 379 transitions (discarded 8 similar events)
// Phase 1: matrix 379 rows 94 cols
[2022-06-09 13:41:55] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 13:41:56] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 387/387 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1550 steps, including 1 resets, run visited all 1 properties in 25 ms. (steps per millisecond=62 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 387/387 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 94 transition count 387
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 22 place count 94 transition count 394
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 94 transition count 394
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 80 transition count 380
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 80 transition count 380
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 94 place count 80 transition count 385
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 241 place count 80 transition count 238
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 268 place count 53 transition count 211
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 295 place count 53 transition count 211
Deduced a syphon composed of 26 places in 0 ms
Drop transitions removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 2 with 141 rules applied. Total rules applied 436 place count 53 transition count 70
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 443 place count 53 transition count 70
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 457 place count 39 transition count 56
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 471 place count 39 transition count 56
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 471 rules in 52 ms. Remains 39 /94 variables (removed 55) and now considering 56/387 (removed 331) transitions.
[2022-06-09 13:41:57] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 13:41:57] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 39 cols
[2022-06-09 13:41:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 13:41:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/94 places, 56/387 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/94 places, 56/387 transitions.
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Built C files in :
/tmp/ltsmin4087487549810768882
[2022-06-09 13:41:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4087487549810768882
Running compilation step : cd /tmp/ltsmin4087487549810768882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1445 ms.
Running link step : cd /tmp/ltsmin4087487549810768882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4087487549810768882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6868610156370171007.hoa' '--buchi-type=spotba'
LTSmin run took 13251 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-15 finished in 20518 ms.
All properties solved by simple procedures.
Total runtime 35511 ms.
BK_STOP 1654782133011
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="StigmergyCommit-PT-06a"
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 StigmergyCommit-PT-06a, 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 r294-smll-165463872500155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06a.tgz
mv StigmergyCommit-PT-06a 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 '
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 ;